Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik

DOI10.1007/BF02023019zbMath0533.03007MaRDI QIDQ3315483

Matthias Emil Ragaz

Publication date: 1983

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/138013

zbMATH Keywords

undecidability; satisfiability; arithmetical hierarchy; arithmetical formula; infinite-valued predicate logic

Mathematics Subject Classification ID

03D35: Undecidability and degrees of sets of sentences

03B50: Many-valued logic

Related Items

Arithmetical complexity of fuzzy predicate logics -- a survey. II., 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000, Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre, Monadic Fragments of Gödel Logics: Decidability and Undecidability Results, Mathematical Fuzzy Logics, SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability

Cites Work

• Unnamed Item
• Unnamed Item
• Axiomatizability of some many valued predicate calculi
• On the definition of an infinitely-many-valued predicate calculus
• Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
• Axiomatization of the infinite-valued predicate calculus
• Further results on infinite valued predicate logic
• On the Consistency of the Axiom of Comprehension in the Lukasiewicz Infinite Valued Logic.
• A weak completeness theorem for infinite valued first-order logic
• A theorem about infinite-valued sentential logic