Cut-free formulations for a quantified logic of here and there

DOI10.1016/J.APAL.2010.09.009zbMath1253.03087OpenAlexW2061774562MaRDI QIDQ638492

Grigori Mints

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.09.009

zbMATH Keywords

stable modelscut-free logical systemslogic of here-and-therestrong equivalence of logic programs

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Syntactic ASP forgetting with forks ⋮ Syntactic ASP forgetting with forks

Cites Work

• Unnamed Item
• Indexed systems of sequents and cut-elimination
• Characterization of strongly equivalent logic programs in intermediate logics
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Propositional theories are strongly equivalent to logic programs

This page was built for publication: Cut-free formulations for a quantified logic of here and there