Taming logic

DOI10.1007/BF01049413zbMATH Open0847.03013OpenAlexW4241621245MaRDI QIDQ1909607FDOQ1909607

Authors: Maarten Marx, Szabolcs Mikulás, István Németi 

Publication date: 8 October 1996

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01049413

Recommendations

• Taming first-order logic
• Taming paraconsistent (and other) logics: an algorithmic approach
• scientific article; zbMATH DE number 1047502
• Well-behaved modal logics

zbMATH Keywords

classical first-order logictamingarrow logicbad-behaving logicwell-behaving logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-dimensional modal logic
• Title not available (Why is that?)
• Some Varieties Containing Relation Algebras
• Title not available (Why is that?)
• Cylindric modal logic
• A Stone Type Representation Theorem for Algebras of Relations of Higher Rank
• Representations of distributive lattice-ordered semigroups with binary relations
• Title not available (Why is that?)
• A note on the tense logic of dominoes
• Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
• Aspects of philosophical logic. Some logical forays into central notions of linguistics and philosophy. (Proceedings of a workshop on formal semantics of natural languages which was held in Tübingen from the 1st to the 3rd of December 1977)
• Decidability of Relation Algebras with Weakened Associativity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Complexity of equations valid in algebras of relations. II: Finite axiomatizations
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• Title not available (Why is that?)
• A class of decidable information logics
• Undecidable relativizations of algebras of relations
• Perfect Pavelka logic

This page was built for publication: Taming logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909607)