Minimal predicates, fixed-points, and definability

Journal of Symbolic Logic

Volumn 70, Issue 3, 2005, Pages 696-712

  Van Benthem, Johan ^a,b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24644473661     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1122038910     Document Type: Article

References (22)

1. [1977] P. ACZEL, An introduction to inductive definitions. Handbook of mathematical logic (J. Barwise, editor), North-Holland. Amsterdam. 1977, pp. 739-782.
2. [1999] J. BARWISE and J. VAN BENTHEM, Interpolation, preservation, and pebble games, this JOURNAL, vol. 64 (1999), no. 2. pp. 881-903.
3. [1983] J. VAN BENTHEM, Modal logic and classical logic, Bibliopolis, Naples, 1983.
4. [1985] _, Logic programming, Lecture Notes, Philosophical Institute. Rijksuniversiteit Groningen, 1985.
5. [1996] _, Exploring logical dynamics. CSLI Publications, Stanford, CA, 1996.
6. [2005] _, Modal frame correspondence generalized. 2005, Preprint DARE 148523, Institute for Logic, Language and Computation, University of Amsterdam. Studia Logica. To appear.
7. [2002] R. BENTON. A simple incomplete extension of T. Journal of Philosophical Logic, vol. 31 (2002), no. 6, pp. 527-541.
8. [2001] P. BLACKBURN, M. DE RIJKE, and Y. VENEMA. Modal logic. Cambridge University Press, Cambridge. 2001.
9. [1973] C. C. CHANG and H. J. KEISLER, Model theory. North-Holland. Amsterdam, 1973.
10. [1994] H.C. DOETS. From logic to logic programming. MIT Press. Cambridge. MA, 1994.
11. [1999] H-D EBBINGHAUS and J. FLUM, Finite model theory. Springer-Verlag, Berlin, 1999.
12. [1992] D. GABBAY and H.J. OHLBACH. Quantifier elimination in second-order predicate logic. South African Computer Journal, vol. 7 (1992), pp. 35-43.
13. [2003] V. GORANKO and D. VAKARELOV, Elementary canonical formulas L Extending Sahlqvist's theorem. Department of Mathematics. Rand Afrikaans University, Johannesburg, 2003, and Faculty of Mathematics and Computer Science, Kliment Ohridski University, Sofia. Submitted for publication.
14. [2002] J.M. LE BARS, The 0-1 law fails for frame satisfiability ofpropositional modal logic. Proceedings of Logic in Computer Science, 2002.
15. [1983] B. MAHR and J. MAKOVSKY, Characterizing specification languages which admit initial semantics. Proceedings of the 8th CAAP. Springer, Berlin, 1983.
16. [1971] A.I.MAL'CEV, The metamathematics of algebraic systems, North-Holland, Amsterdam, 1971.
17. [1980] J. MCCARTHY. Circumscription - a form of nonmonotonic reasoning, Artificial Intelligence. vol. 13 (1980), pp. 27-39.
18. [1974] Y. N. MOSCHOVAKIS, Elementary induction on abstract structures. North-Holland, Amsterdam, 1974.
19. [1999] A. NONNENGART and A. SZAŁAS. A fixed-point approach to second-order quantifier elimination with applications to modal correspondence theory. Logic at work (E. Orlowska, editor), Physica-Verlag, Heidelberg, 1999, pp. 89-108.
20. [1990] M-A PAPALASKARI and S. WEINSTEIN, Minimal consequence in sentential logic, Journal of Logic Programming, vol. 9 (1990), pp. 19-31.
21. [1999] C. STIRLING. Bisimulation, modal logic and model checking games, Logic Journal of the Interest Group in Pure and Applied Logics, vol. 7 (1999), no. 1, pp. 103-124.
22. [1965] J. M. WEINSTEIN, First-order properties preserved by direct products. Ph.D. thesis, University of Wisconsin, Madison. 1965.