Minimal predicates, fixed-points, and definability

DOI10.2178/jsl/1122038910zbMath1089.03010OpenAlexW2116809109MaRDI 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 theoremfirst-order logic with predicate minimizationfirst-order syntaxpredicate intersection

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10) Interpolation, preservation, definability (03C40)

Related Items (13)

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

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

This page was built for publication: Minimal predicates, fixed-points, and definability