-
1
-
-
33746363524
-
-
S. Aguzzoli, Geometrical and proof theoretical issues in Łukasiewicz propositional logics, PhD Thesis, University of Siena, 1998.
-
-
-
-
4
-
-
26944469566
-
Brun normal forms for co-atomic Łukasiewicz logics
-
Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2005, Barcelona, Springer
-
Aguzzoli S., D'Antona O.M., and Marra V. Brun normal forms for co-atomic Łukasiewicz logics. Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2005, Barcelona. Lecture Notes in Artificial Intelligence vol. 3571 (2005), Springer 650-661
-
(2005)
Lecture Notes in Artificial Intelligence
, vol.3571
, pp. 650-661
-
-
Aguzzoli, S.1
D'Antona, O.M.2
Marra, V.3
-
5
-
-
0036016137
-
Finite-valued reductions of infinite-valued logics
-
Aguzzoli S., and Gerla B. Finite-valued reductions of infinite-valued logics. Archive for Mathematical Logic 41 (2002) 361-399
-
(2002)
Archive for Mathematical Logic
, vol.41
, pp. 361-399
-
-
Aguzzoli, S.1
Gerla, B.2
-
7
-
-
33746356539
-
-
A.J. Brentjes, Multi-dimensional continued fraction algorithms. Mathematical Centre Tracts, vol. 145, Mathematisch Centrum, Amsterdam, 1981.
-
-
-
-
10
-
-
0003705354
-
-
Springer-Verlag, Berlin
-
Ewald G. Combinatorial Convexity and Algebraic Geometry. Graduate Texts in Mathematics 168 (1996), Springer-Verlag, Berlin
-
(1996)
Graduate Texts in Mathematics
, vol.168
-
-
Ewald, G.1
-
11
-
-
0003612371
-
Proof theory of many-valued logic-linear optimization-logic design: connections and interactions
-
Hähnle R. Proof theory of many-valued logic-linear optimization-logic design: connections and interactions. Soft Computing 1 (1997) 107-119
-
(1997)
Soft Computing
, vol.1
, pp. 107-119
-
-
Hähnle, R.1
-
12
-
-
33745257490
-
-
Kluwer, Dordrecht
-
Hájek P. Metamathematics of Fuzzy Logic. Trends in Logic 4 (1998), Kluwer, Dordrecht
-
(1998)
Trends in Logic
, vol.4
-
-
Hájek, P.1
-
13
-
-
0002141730
-
A theorem about infinite-valued sentential logic
-
McNaughton R. A theorem about infinite-valued sentential logic. Journal of Symbolic Logic 16 (1951) 1-13
-
(1951)
Journal of Symbolic Logic
, vol.16
, pp. 1-13
-
-
McNaughton, R.1
-
14
-
-
0023537271
-
Satisfiability in many-valued sentential logic is NP-complete
-
Mundici D. Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science 52 (1987) 145-153
-
(1987)
Theoretical Computer Science
, vol.52
, pp. 145-153
-
-
Mundici, D.1
-
15
-
-
0001230644
-
A constructive proof of McNaughton's theorem in infinite-valued logics
-
Mundici D. A constructive proof of McNaughton's theorem in infinite-valued logics. Journal of Symbolic Logic 59 (1994) 596-602
-
(1994)
Journal of Symbolic Logic
, vol.59
, pp. 596-602
-
-
Mundici, D.1
|