Satisfiability in composition-nominative logics

DOI10.2478/s13537-012-0027-3zbMath1284.03199OpenAlexW2100235980MaRDI 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

zbMATH Keywords

validitycompositionalitypartial logicssatisfiabilityfirst-order logicspartial predicatescompostion-nominative logicsnominativity

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logic in computer science (03B70)

Related Items (1)

Composition-nominative logics as institutions

Uses Software

• Z

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

This page was built for publication: Satisfiability in composition-nominative logics