A Variant of Thomason's First-Order Logic CF Based on Situations
Peter Mott and Xuegang Wang
Source: Notre Dame J. Formal Logic Volume 39, Number 1
(1998), 74-93.
Abstract
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.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1039293021
Mathematical Reviews number (MathSciNet): MR1671742
Digital Object Identifier: doi:10.1305/ndjfl/1039293021
Zentralblatt MATH identifier: 0967.03022
References
[1] Abiteboul, S., R. Hull, and V. Vianu, Foundations of Databases, Addison-Wesley, Reading, 1995.
Zentralblatt MATH: 0848.68031
[2] Akama, S., ``Constructive predicate logic with strong negation and model theory,'' Notre Dame Journal of Formal Logic, vol. 29 (1988), pp. 18--27.
Mathematical Reviews (MathSciNet): MR89k:03026
Zentralblatt MATH: 0647.03005
Project Euclid: euclid.ndjfl/1093637767
Digital Object Identifier: doi:10.1305/ndjfl/1093637767
[3] Alferes, J. J., and L. M. Pereira, Reasoning with Logic Programming, Lecture Notes in Artificial Intelligence 1111, Springer-Verlag, Berlin, 1996.
Mathematical Reviews (MathSciNet): MR98k:68031
[4] Almukdad, A., and D. Nelson, ``Constructible falsity and inexact predicates,'' The Journal of Symbolic Logic, vol. 49 (1984), pp. 231--33.
Mathematical Reviews (MathSciNet): MR86c:03020
Zentralblatt MATH: 0575.03016
JSTOR: links.jstor.org
Digital Object Identifier: doi:10.2307/2274105
[5] Barwise, J., The Situation in Logic, CSLI Lecture Notes 17, CSLI, Stanford, 1989.
Mathematical Reviews (MathSciNet): MR90g:03033
Zentralblatt MATH: 0664.03003
[6] Barwise, J., and J. Etchemendy, The Liar: An Essay on Truth and Circularity, Oxford University Press, Oxford, 1987.
Mathematical Reviews (MathSciNet): MR88k:03009
Zentralblatt MATH: 0678.03001
[7] Barwise, J., and J. Etchemendy, ``Information, infons, and inference,'' pp. 33--78 in Situation Theory and Its Applications, vol. 1, edited by R. Cooper, K. Mukai, and J. Perry, CSLI Lecture Notes 22, CSLI, Stanford, 1990.
Mathematical Reviews (MathSciNet): MR1260726
[8] Barwise, J., and J. Perry, Situations and Attitudes, The MIT Press, Cambridge, 1983.
Mathematical Reviews (MathSciNet): MR2001h:03051
Zentralblatt MATH: 0946.03007
[9] Bencivenga, E., ``Free logics,'' pp. 373--426 in Alternatives in Classical Logic, vol. 3, Handbook of Philosophical Logic, edited by D. Gabbay and F. Guenthner, D. Reidel, Dordrecht, 1985.
Zentralblatt MATH: 0875.03020
[10] Devlin, K., Logic and Information, Cambridge University Press, Cambridge, 1991.
Mathematical Reviews (MathSciNet): MR93c:68094
Zentralblatt MATH: 0732.03001
[11] Dummett, M., Elements of Intuitionism, Oxford Logic Guides, Clarendon Press, Oxford, 1977.
Mathematical Reviews (MathSciNet): MR58:16194
Zentralblatt MATH: 0358.02032
[12] Fernando, T., ``On the logic of situation theory,'' pp. 97--116 in Situation Theory and Its Applications, vol. 1, edited by R. Cooper, K. Mukai, and J. Perry, CSLI Lecture Notes 22, CSLI, Stanford, 1990.
Mathematical Reviews (MathSciNet): MR1260728
[13] Fitch, F. B., Symbolic Logic, Ronald Press, New York, 1952.
Mathematical Reviews (MathSciNet): MR15,592n
Zentralblatt MATH: 0049.00504
[14] Frege, G., ``Begriffsschrift (Chapter I),'' pp. 1--20 in Translations from the Philosophical Writings of Gottlob Frege, edited by P. Geach and M. Black, Basil Blackwell, Oxford, 1952.
[15] Garson, J. W., ``Quantification in modal logic,'' pp. 249--307 in Extensions of Classical Logic, vol. 2, Handbook of Philosophical Logic, edited by D. Gabbay and F. Guenthner, D. Reidel, Dordrecht, 1985.
Mathematical Reviews (MathSciNet): MR844600
Zentralblatt MATH: 0875.03050
[16] Gentzen, G., ``Investigations into logical deduction,'' pp. 68--131 in The Collected Papers of Gerhard Gentzen, edited by M. E. Szabo, North-Holland, Amsterdam, 1969.
Zentralblatt MATH: 0209.30001
[17] Gurevich, Y., ``Intuitionistic logic with strong negation,'' Studia Logica, vol. 36 (1977), pp. 49--59.
Mathematical Reviews (MathSciNet): MR58:160
Zentralblatt MATH: 0366.02015
Digital Object Identifier: doi:10.1007/BF02121114
[18] Lopez-Escobar, E. G. K., ``Refutability and elementary number theory,'' Indagationes Mathematicae, vol. 34 (1972), pp. 362--74.
Mathematical Reviews (MathSciNet): MR48:10772
Zentralblatt MATH: 0262.02027
[19] Markov, A. A., ``Constructive logic'' (in Russian), Uspekhi Matematičeskih Nauk, vol. 5 (1950), pp. 187--88.
[20] Mott, P. L., ``Intuitionistic logic with a `definitely' operator,'' Research Report 97.05, School of Computer Studies, University of Leeds, 1997.
[21] Nelson, D., ``Constructible falsity,'' The Journal of Symbolic Logic, vol. 14 (1949), pp. 16--26.
Mathematical Reviews (MathSciNet): MR10,669a
Zentralblatt MATH: 0033.24304
JSTOR: links.jstor.org
Digital Object Identifier: doi:10.2307/2268973
[22] Rasiowa, H., ``$\cal N$-lattices and constructive logic with strong negation,'' Fundamenta Mathematicae, vol. 46 (1958), pp. 61--80.
Mathematical Reviews (MathSciNet): MR20:5137
Zentralblatt MATH: 0087.00905
[23] Reiter, R., ``On closed world databases,'' pp. 55--76 in Logic and Databases, edited by H. Gallaire and J. Minker, Plenum Press, New York, 1978.
[24] Routley, R., ``Semantical analyses of propositional systems of Fitch and Nelson,'' Studia Logica, vol. 33 (1974), pp. 283--98.
Mathematical Reviews (MathSciNet): MR51:70
Zentralblatt MATH: 0356.02022
Digital Object Identifier: doi:10.1007/BF02123283
[25] Thomason, R. H., ``A semantical analysis of constructible falsity,'' Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 (1969), pp. 247--57.
Mathematical Reviews (MathSciNet): MR256854
Zentralblatt MATH: 0181.00901
Digital Object Identifier: doi:10.1002/malq.19690151602
[26] Troelstra, A. S., Choice Sequences: A Chapter of Intutitionistic Mathematics, Oxford Logic Guides, Clarendon Press, Oxford, 1977.
Mathematical Reviews (MathSciNet): MR57:15979
Zentralblatt MATH: 0355.02026
[27] Troelstra, A. S., and D. van Dalen, Constructivism in Mathematics: An Introduction, vol. 1, North-Holland, Amsterdam, 1988.
Mathematical Reviews (MathSciNet): MR90e:03002a
Zentralblatt MATH: 0653.03040
[28] van Dalen, D. ``Intuitionistic logic'', pp. 225--339 in Alternatives in Classical Logic, vol. 3, Handbook of Philosophical Logic, edited by D. Gabbay and F. Guenthner, D. Reidel, Dordrecht, 1985.
Zentralblatt MATH: 0875.03038
[29] Veltman, F., ``Defaults in update semantics,'' Journal of Philosophical Logic, vol. 25 (1996), pp. 221--61.
Mathematical Reviews (MathSciNet): MR97d:68220
Zentralblatt MATH: 0860.03025
Digital Object Identifier: doi:10.1007/BF00248150
[30] Vorob'ev, N. N., ``Constructive propositional calculus with strong negation'' (in Russian), Doklady Akademii Nauk SSSR, vol. 85 (1952), pp. 465--68.
Mathematical Reviews (MathSciNet): MR49836
[31] Wagner, G., ``Logic programming with strong negation and inexact predicates,'' Journal of Logic and Computation, vol. 1 (1991), pp. 835--59.
Mathematical Reviews (MathSciNet): MR1165249
Zentralblatt MATH: 0738.68018
Digital Object Identifier: doi:10.1093/logcom/1.6.835
[32] Wansing, H., Logic of Information Structures, Lecture Notes in Artificial Intelligence 681, Springer-Verlag, Berlin, 1993.
Mathematical Reviews (MathSciNet): MR95b:03035
Zentralblatt MATH: 0788.03001
Notre Dame Journal of Formal Logic
