Binding Forms in First-Order Logic

DOI10.4230/LIPIcs.CSL.2015.648zbMath1373.03014OpenAlexW2252339295MaRDI QIDQ5351988

Fabio Mogavero, Giuseppe Perelli

Publication date: 31 August 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CSL.2015.648

zbMATH Keywords

first-order logicmodel checkingsatisfiabilitydecidable fragments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

Complexity of the multilevel critical node problem ⋮ Taming strategy logic: non-recurrent fragments ⋮ Uniform guarded fragments

This page was built for publication: Binding Forms in First-Order Logic