Forcing in Łukasiewicz predicate logic

DOI10.1007/s11225-008-9120-yzbMath1170.03013OpenAlexW2140360098MaRDI QIDQ935024

Luca Spada, George Georgescu, Antonio Di Nola

Publication date: 31 July 2008

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-008-9120-y

zbMATH Keywords

Łukasiewicz logicgeneric structuresfirst-order many-valued logicRobinson forcing

Mathematics Subject Classification ID

Many-valued logic (03B50) Abstract deductive systems (03B22) Model-theoretic forcing (03C25)

Related Items

Triangular norm based predicate fuzzy logics, Forcing operators on MTL-algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpretation of AF \(C^*\)-algebras in Łukasiewicz sentential calculus
• Forcing, arithmetic, division rings
• Metamathematics of fuzzy logic
• Algebraic foundations of many-valued reasoning
• On arithmetic in the Cantor-Łukasiewicz fuzzy set theory
• Algebraic Analysis of Many Valued Logics
• Fragments of Many-Valued Statement Calculi
• A New Proof of the Completeness of the Lukasiewicz Axioms
• On theories and models in fuzzy predicate logics
• Algebraizable logics
• Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
• Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
• Simplicial structures in MV-algebras and logic
• On the Consistency of the Axiom of Comprehension in the Lukasiewicz Infinite Valued Logic.
• Omitting types in fuzzy logic with evaluated syntax
• The Axiom of Comprehension in Infinite Valued Logic.
• Omitting types of prenex formulas
• Completing theories by forcing
• A theorem about infinite-valued sentential logic