Logic between expressivity and complexity

DOI10.1007/978-3-642-14203-1_10MaRDI QIDQ5747755zbMATH OpenOpenAlexFDO

Authors Johan van Benthem

Publication date 14 September 2010

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14203-1_10

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Expressing versus proving: relating forms of complexity in logic
• scientific article; zbMATH DE number 4076613
• Making assumptions in the automated derivation
• scientific article; zbMATH DE number 5000990
• Logics, mathematics, automatic deduction

Cites work

• A new modal Lindström theorem
• Guards, bounds, and generalized semantics
• scientific article; zbMATH DE number 5872415 (Why is no real title available?)
• Lindstrom theorems for fragments of first-order logic
• Minimal predicates, fixed-points, and definability
• Modal languages and bounded fragments of predicate logic

Cited in

(1)

• Expressing versus proving: relating forms of complexity in logic

This page was built for publication: Logic between expressivity and complexity

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