Henkin quantifiers and the definability of truth

DOI10.1023/A:1026533210855zbMath0970.03035OpenAlexW1967259846MaRDI QIDQ5928923

Gabriel Sandu, Tapani Hyttinen

Publication date: 21 October 2001

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026533210855

zbMATH Keywords

definability of truthfixed point logicHenkin quantifierIF logicindependence-friendly logic

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Philosophical and critical aspects of logic and foundations (03A05) Classical first-order logic (03B10) Logic with extra quantifiers and operators (03C80)

Related Items (2)

Truth and definite truth ⋮ Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the logic of informational independence and its applications
• IF-logic and truth-definition
• Quantifiers vs. Quantification Theory
• PARTIALLY ORDERED CONNECTIVES
• Hierarchies of Partially Ordered Connectives and Quantifiers
• Compositional semantics for a language of imperfect information
• Outline of a Theory of Truth
• Finite partially-ordered quantification
• Finite Model Theory

This page was built for publication: Henkin quantifiers and the definability of truth