Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 39, Number 1 (1998), 74-93.
A Variant of Thomason's First-Order Logic CF Based on Situations
In this paper, we define a first-order logic CFʹ with strong negation and bounded static quantifiers, which is a variant of Thomason's logic CF. For the logic CFʹ, the usual Kripke formal semantics is defined based on situations, and a sound and complete axiomatic system is established based on the axiomatic systems of constructive logics with strong negation and Thomason's completeness proof techniques. With the use of bounded quantifiers, CFʹ allows the domain of quantification to be empty and allows for nondenoting constants. CFʹ is intended as a fragment of a logic for situation theory. Thus the connection between CFʹ and infon logic is discussed.
Notre Dame J. Formal Logic, Volume 39, Number 1 (1998), 74-93.
First available in Project Euclid: 7 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Wang, Xuegang; Mott, Peter. A Variant of Thomason's First-Order Logic CF Based on Situations. Notre Dame J. Formal Logic 39 (1998), no. 1, 74--93. doi:10.1305/ndjfl/1039293021. https://projecteuclid.org/euclid.ndjfl/1039293021