A note on functions associated with Gödel formulas

Soft Computing

Volumn 4, Issue 4, 2000, Pages 206-209

  Gerla, B ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Free linearly ordered Heyting algebras; Functional completeness; G del logic

Indexed keywords

SOFT COMPUTING;

FUNCTIONAL COMPLETENESS; HEYTING ALGEBRAS; LUKASIEWICZ LOGIC;

SOFTWARE ENGINEERING;

EID: 2942542352     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/PL00009890     Document Type: Article

References (8)

1. Baaz M (1996) Infinite-valued Gödel logics with 0-1-projections and relativizations. In: Hajek P (Ed.) GODEL'96 - Logical Foundations of Mathematics, Computer Science and Physics. Lecture Notes in Logic 6, Springer-Verlag, 23-33
2. Cohn PM (1981) Universal Algebra. D. Reidel Pub. Co., Dordrecht
3. Dummet M (1959) A propositional calculus with denumerable matrix. J. Symbolic Logic 24: 97-106
4. Gödel K (1932) Zum intuitionistischen Aussagenkalköl. Anzeiger Akademie der Wissenschaften Wien, Math.-natur- wissensch. Klasse 69: 65-66. Also in Ergebnisse eines matematischen Kolloquiums 4: 40, 1933
5. Hájek P (1998) Metamathematics of Fuzzy Logic. Kluwer, Dordrecht
6. Horn A (1969a) Logic with truth values in a linearly ordered heyting algebra. J. Symbolic Logic 34: 395-408
7. Horn A (1969b) Free L-algebras. J. Symbolic Logic 34: 475480
8. McNaughton R (1951) A theorem about infinite-valued sentential logic. J. Symbolic Logic 16: 1-13