Minimal predicates, fixed-points, and definability

DOI10.2178/jsl/1122038910zbMath1089.03010MaRDI QIDQ5718684

J. F. A. K. van Benthem

Publication date: 16 January 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1122038910

zbMATH Keywords

preservation theorem; first-order logic with predicate minimization; first-order syntax; predicate intersection

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B10: Classical first-order logic

03C40: Interpolation, preservation, definability

Related Items

Syntactic Completeness of Proper Display Calculi, Supervenience, Dependence, Disjunction, Logic between Expressivity and Complexity, Sahlqvist theorem for modal fixed point logic, Sahlqvist correspondence for modal mu-calculus, Algorithmic correspondence for intuitionistic modal mu-calculus, McCarthy variations in a modal key, Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA, The bounded proof property via step algebras and step frames, The many faces of interpolation, Annotation theories over finite graphs, Algorithmic correspondence and canonicity for non-distributive logics, Modal frame correspondences and fixed-points

Cites Work

• Circumscription - a form of non-monotonic reasoning
• A simple incomplete extension of T which is the union of two complete modal logics with f. m. p
• Minimal consequence in sentential logic
• Unnamed Item
• Unnamed Item
• Unnamed Item