Minimal predicates, fixed-points, and definability

DOI10.2178/JSL/1122038910MaRDI QIDQ5718684zbMATH OpenOpenAlexFDO

Authors Johan 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

first-order logic with predicate minimizationfirst-order syntaxpredicate intersectionpreservation theorem

Mathematics Subject Classification ID

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

Recommendations

• Fixed-point extensions of first-order logic
• On Minimal Models
• Definable fixed points in modal and temporal logics -- a survey
• scientific article; zbMATH DE number 4008383
• Fixed points of formulas with double modalities

Cites work

• A simple incomplete extension of T which is the union of two complete modal logics with f. m. p
• Circumscription - a form of non-monotonic reasoning
• scientific article; zbMATH DE number 986406 (Why is no real title available?)
• scientific article; zbMATH DE number 708499 (Why is no real title available?)
• scientific article; zbMATH DE number 1749192 (Why is no real title available?)
• Minimal consequence in sentential logic

Cited in

(19)

• The many faces of interpolation
• Annotation theories over finite graphs
• Algorithmic correspondence and canonicity for non-distributive logics
• Modal frame correspondences and fixed-points
• Sahlqvist theorem for modal fixed point logic
• Sahlqvist correspondence for modal mu-calculus
• MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER
• Algorithmic correspondence for intuitionistic modal mu-calculus
• scientific article; zbMATH DE number 818378 (Why is no real title available?)
• Syntactic Completeness of Proper Display Calculi
• scientific article; zbMATH DE number 7297896 (Why is no real title available?)
• Supervenience, dependence, disjunction
• Minimal Categorical System and Predication Theory In Porphyry
• McCarthy variations in a modal key
• Logic between expressivity and complexity
• Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
• Revising non-monotonic theories with sufficient and necessary conditions: the case of defeasible logic
• Correspondence theory on vector spaces
• The bounded proof property via step algebras and step frames

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

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