The ground-negative fragment of first-order logic is -complete
From MaRDI portal
Publication:4934025
DOI10.2307/2586615zbMath0941.03039OpenAlexW2016284852MaRDI QIDQ4934025
Publication date: 31 July 2000
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2586615
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
This page was built for publication: The ground-negative fragment of first-order logic is -complete