Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik
From MaRDI portal
Publication:3315483
DOI10.1007/BF02023019zbMath0533.03007MaRDI QIDQ3315483
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
undecidabilitysatisfiabilityarithmetical hierarchyarithmetical formulainfinite-valued predicate logic
Related Items (7)
UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS ⋮ Monadic Fragments of Gödel Logics: Decidability and Undecidability Results ⋮ Mathematical Fuzzy Logics ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre ⋮ SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability ⋮ Arithmetical complexity of fuzzy predicate logics -- a survey. II.
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
This page was built for publication: Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik