Satisfiability in composition-nominative logics

DOI10.2478/S13537-012-0027-3MaRDI QIDQ2445092zbMATH OpenOpenAlexFDO

Authors M. S. Nikitchenko, Valentyn G. Tymofieiev

Publication date 14 April 2014

Published in Central European Journal of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/s13537-012-0027-3

zbMATH Keywords

satisfiabilityvaliditycompositionalityfirst-order logicspartial logicspartial predicatescompostion-nominative logicsnominativity

Mathematics Subject Classification ID

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

Recommendations

• Satisfiability problem in propositional and renominative composition-nominative logic
• Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality
• Composition nominative first order logics
• First-order composition-nominative logics
• Composition-nominative logics as institutions

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 42431 (Why is no real title available?)
• scientific article; zbMATH DE number 108368 (Why is no real title available?)
• scientific article; zbMATH DE number 1257634 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 2084366 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A machine program for theorem-proving
• A practical approach to partial functions in CVC Lite
• Compositionality: ontology and mereology of domains. Some clarifying observations in the context of software engineering
• Concurrency, compositionality, and correctness. Essays in honor of Willem-Paul de Roever
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• First-order logics of quasiary predicates
• Nominal logic, a first order theory of names and binding
• Partial logics reconsidered: A conservative approach
• Reasoning about partial functions in the formal development of programs
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• The B-Book

Cited in

(10)

• Satisfiability of compositional separation logic with tree predicates and data constraints
• Satisfiability of mixed Horn formulas
• Spectra and satisfiability for logics with successor and a unary function
• Composition nominative logics of equitone predicates
• Satisfiability problem in propositional and renominative composition-nominative logic
• Many-sorted first-order composition-nominative logic as institution
• Composition-nominative logics as institutions
• Single-domain free logic and the problem of compositionality
• Composition-nominative logics of quasi-ary predicates: semantic aspects
• Satisfiability problem in composition-nominative logics of quantifier-equational level with weak equality

Describes a project that uses

Uses Software

• Z

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

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