Skip to main content
SpringerLink
Log in

Taming logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

In this paper, we introduce a general technology, calledtaming, for finding well-behaved versions of well-investigated logics. Further, we state completeness, decidability, definability and interpolation results for a multimodal logic, calledarrow logic, with additional operators such as thedifference operator, andgraded modalities. Finally, we give a completeness proof for a strong version of arrow logic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andréka, H., 1991a, “Representation of distributive semilattice-ordered semigroups with binary relations”,Algebra Universalis 28, 12–25.

    Google Scholar 

  • Andréka, H., 1991b, “Complexity of the equations valid in algebras of relations”, Thesis for D.Sc. with the Hungarian Academy of Sciences, Budapest.

  • Andréka, H., Kurucz, á., Németi, I., Sain, I. and Simon, A., 1994a, “Exactly which logics touched by the dynamic trend are decidable?”, pp. 67–86 inProc. of 9th Amsterdam Coll., D. Dekker and M. Stokhof, eds., University of Amsterdam.

  • Andréka, H., Mikulás, Sz., and Németi, I., 1994b, “You can decide differently: decidability of relativized representable relation algebras with graded modalities”, manuscript, Mathematical Institute, Budapest.

    Google Scholar 

  • Andréka, H. and Németi, 1994, “Craig interpolation does not imply amalgamation after all”, manuscript, Mathematical Institute, Budapest.

    Google Scholar 

  • Andréka, H., Németi, I., and Sain, I., 1995a,Algebras of Relations and Algebraic Logic, to appear.

  • Andréka, H., Németi, I., Sain, I., and Kurucz, á., 1995b, “Methodology of applying algebraic logic to logic”, manuscript, Mathematical Institute, Budapest.

    Google Scholar 

  • Andréka, H., van Benthem, J., and Németi, I., 1995d, “Back and forth between modal logic and classical logic”, ILLC Research Report ML-95-04, University of Amsterdam, revised versionBulletin of IGPL, to appear.

  • Andréka, H. and Thompson, R.J., 1988, “A Stone-type representation theorem for algebras of relations of higher rank”,Trans. Amer. Math. Soc. 309(2), 671–682.

    Google Scholar 

  • van Benthem, J., 1994a, “A note on dynamic arrow logic”, inLogic and Information Flow, van J. Eijck and A. Visser, eds., MIT Press.

  • van Benthem, J., 1994b, “Two essays on semantic modeling, the sources of complexity: content versus wrapping”, ILLC Technical Report X-94-01, University of Amsterdam.

  • Bull, R. and Segerberg, H., 1984, “Basic modal logic”, pp. 1–88 inHandbook of Philosophical Logic, Vol. 2, D.M. Gabbay and F. Guenther, eds., Dordrecht: Reidel.

    Google Scholar 

  • Chang, C.C. and Keisler, H.J., 1990,Model Theory, Amsterdam: North-Holland.

    Google Scholar 

  • Csirmaz, L., Gabbay, D.M., and de Rijke, M., eds., 1995,Logic Colloquium'92, SILLI.

  • Gabbay, D.M., 1981, “An irreflexivity lemma with applications to axiomatizations of conditions on linear frames”, pp. 91–117 inAspects of Philosophical Logic, U. Mönnich, ed., Dordrecht: Reidel.

    Google Scholar 

  • Gargov, G., Passy, S., and Tinchev, T., 1987, “Modal environment for Boolean speculations”, pp. 253–263 inMathematical Logic and its Applications, D. Skordev, ed., New York: Plenum Press.

    Google Scholar 

  • Henkin, L., Monk, J.D., and Tarski, A., 1985,Cylindric Algebras, Parts I, II, Amsterdam: North-Holland.

    Google Scholar 

  • van der Hoek, W., 1992, “Modalities for reasoning about knowledge and quantities”, Ph.D. dissertation, Free University Amsterdam.

  • Hughes, G.E. and Creswell, M.J., 1984,A Companion to Modal Logic, London: Methuen.

    Google Scholar 

  • Koymans, R., 1989, “Specifying message passing and time-critical systems with temporal logic”, Ph.D. dissertation, Technical University Eindhoven.

  • Maddux, R.D., 1982, “Some varieties containing relation algebras”,Trans. Amer. Math. Soc. 272, 501–526.

    Google Scholar 

  • Marx, M., 1992, “Dynamic arrow logic”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inArrow Logic and Multimodal Logics, M. Marx and L. Pólos, eds., to appear.

  • Marx, M., 1995, “Algebraic relativization and arrow logic”, Ph.D. dissertation, ILLC Dissertation Series 1995–3, University of Amsterdam.

  • Marx, M., Mikulás, Sz., Németi, I., and Sain, I., 1992, “Investigations in arrow logic”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inArrow Logic and Multimodal Logics, M. Marx and L. Pólos, eds., to appear.

  • Marx, M., Mikulás, Sz., Németi, I., and Simon, A., 1994, “And now for something completely different: axiomatization of relativized representable relation algebras with the difference operator”, manuscript, Mathematical Institute, Budapest.

    Google Scholar 

  • Marx, M. and Pólos, L., 1995, eds.,Arrow Logic and Multimodal Logics, to appear.

  • Marx, M. and Venema, Y.,Multidimensional Modal Logic, in preparation.

  • Mikulás, Sz., 1992, “Complete calculus for conjugated arrow logic”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inArrow Logic and Multimodal Logics, M. Marx and L. Pólos, eds., to appear.

  • Mikulás, Sz., 1995a, “Taming first-order logic”, inProc. ACCOLADE'95, to appear.

  • Mikulás, Sz., 1995b, “Taming logics”, Ph.D. dissertation, ILLC, University of Amsterdam, ILLC Dissertation Series, pp. 95–12.

  • Mikulás, Sz., Németi, I., and Sain, I., 1995, “Decidable logics of the dynamic trend, and relativized relation algebras”, inLogic Colloquium'92, L. Csirmaz, D.M. Gabbay, and M. de Rijke, eds., SILLI

  • Mönnich, U., ed., 1981,Aspects of Philosophical Logic, Dordrecht: Reidel.

    Google Scholar 

  • Németi, I., 1986, “Free algebras and decidability in algebraic logic”, Thesis for D.Sc. with the Hungarian Academy of Sciences, Budapest.

  • Németi, I., 1987. “Decidability of relation algebras with weakened associativity”,Proc. of Am. Math. Soc. 100(2), 340–344.

    Google Scholar 

  • Németi, I., 1991, “Algebraizations of quantifier logics, an introductory overview”, drastically short-ened version:Studia Logica,50, 485–569, full version: Mathematical Institute, Budapest.

    Google Scholar 

  • Németi, I., 1992, “Decidability of weakened versions of first-order logic”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inLogic Colloquium'92, L. Csirmaz, D.M. Gabbay, and M. de Rijke, eds., SILLI.

  • De Rijke, M., 1993, “Extending modal logic”, Ph.D. dissertation, ILLC Dissertation Series 1993–4, University of Amsterdam.

  • De Rijke, M. and Venema, Y, 1991, “Sahlqvist's theorem for Boolean algebras with operators”, ITLI Prepublication Series ML-91-10, University of Amsterdam; andStudia Logica, to appear.

  • Sahlqvist, H., 1975, “Completeness and correspondence in the first order and second order semantics for modal logic”, inProc. of the Third Scandinavian Logic Symposium Uppsala 1973, S. Kanger, ed., Amsterdam: North-Holland.

    Google Scholar 

  • Sain, I., 1988, “Is ‘some-other-time’ sometimes better than ‘sometime’ in proving partial correctness of programs?”,Studia Logica XLVII(3), 279–301.

    Google Scholar 

  • Simon, A., 1992, “Arrow logic does not have deduction theorem”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inArrow Logic and Multimodal Logics, M. Marx and L. Pólos, eds., to appear.

  • Tarski, A. and Givant, S., 1987,A Formalisation of Set Theory without Variables, Providence, Rhode Island: AMS Colloquium Publications.

    Google Scholar 

  • Venema, Y., 1992a, “Many-dimensional Modal Logic”, Ph.D. dissertation, University of Amsterdam.

  • Venema, Y, 1992b, “A crash course in arrow logic”, inProc. Logic at Work, CCSOM, University of Amsterdam; and inArrow Logic and Multimodal Logics, M. Marx and L. Pólos, eds., to appear.

  • Venema, Y, 1995, “Cylindric modal logic”,Journal of Symbolic Logic, to appear.

Download references

Author information

Authors and Affiliations

  1. Center for Computer Science in Organization and Management, University of Amsterdam, Oude Turfmarkt 151, 1012, GC, Amsterdam, The Netherlands

    Maarten Marx

  2. Department of Mathematics and Computation, University of Amsterdam, Pl. Muidergracht 24, 1018, TV, Amsterdam, The Netherlands

    Szabolcs Mikul

  3. Mathematical Institute of the Hungarian Academy of Science, P.O.B. 127, H-1364, Budapest, Hungary

    István Németi

Authors
  1. Maarten Marx
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Szabolcs Mikul
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. István Németi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Thanks to ILLC for financial and CCSOM for technical support.

Supported by Hungarian National Foundation for Scientific Research grant Nos. F17452 and T16448.

Supported by Hungarian National Foundation for Scientific Research grant No. T16448.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marx, M., Mikul, S. & Németi, I. Taming logic. J Logic Lang Inf 4, 207–226 (1995). https://doi.org/10.1007/BF01049413

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01049413

Key words

Search

Navigation