A Function Elimination Method for Checking Satisfiability of Arithmetical Logics

DOI10.3233/FI-2016-1303MaRDI QIDQ2968852zbMATH OpenOpenAlexFDO

Authors Valentina Castiglioni, Ruggero Lanotte, Simone Tini

Publication date 22 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1303

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Quantifier elimination, model completeness, and related topics (03C10) First-order arithmetic and fragments (03F30)

Recommendations

• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• Free-cut elimination in linear logic and an application to a feasible arithmetic
• Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic
• Tools and Algorithms for the Construction and Analysis of Systems
• Fixed-point elimination in the intuitionistic propositional calculus
• Fixed-Point Elimination in the Intuitionistic Propositional Calculus
• scientific article; zbMATH DE number 1323296
• On strictly arithmetical completeness in logics of programs
• Arithmetic representation of functions in multivalued logic and a parallel algorithm for finding such representations
• On arithmetic complexity of certain constructive logics

This page was built for publication: A Function Elimination Method for Checking Satisfiability of Arithmetical Logics

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