Satisfiability in composition-nominative logics
From MaRDI portal
Publication:2445092
DOI10.2478/s13537-012-0027-3zbMath1284.03199MaRDI QIDQ2445092
Mykola Nikitchenko, Valentyn G. Tymofieiev
Publication date: 14 April 2014
Published in: Central European Journal of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s13537-012-0027-3
validity; compositionality; partial logics; satisfiability; first-order logics; partial predicates; compostion-nominative logics; nominativity
03B45: Modal logic (including the logic of norms)
03B60: Other nonclassical logic
03B70: Logic in computer science
Related Items
Uses Software
Cites Work
- Concurrency, compositionality, and correctness. Essays in honor of Willem-Paul de Roever
- Partial logics reconsidered: A conservative approach
- Nominal logic, a first order theory of names and binding
- First-order logics of quasiary predicates
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Solving SAT and SAT Modulo Theories
- The B-Book
- Compositionality: Ontology and Mereology of Domains
- A machine program for theorem-proving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item