Abstract
In intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics, however, proof search may continue indefinitely, finding neither a proof nor a disproof of a given subgoal.
In this paper we characterize a family of truth-preserving abstractions from intuitionistic first-order logic to the monadic fragment of classical first-order logic. Because they are truthful, these abstractions can be used to disprove sequents in intuitionistic first-order logic.
This work supported in part by DemTech grant 10-092309 from the Danish Council for Strategic Research, Programme Commission on Strategic Growth Technologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreoli, J.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297 (1992)
Claessen, K., Sorensson, N.: New techniques that improve mace-style finite model finding. In: Baumgartner, P., Fermueller, C. (eds.) Proceedings of the CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications, Miami, USA (2003)
Giunchiglia, F., Walsh, T.: A theory of abstraction. Artif. Intell. 57(2-3), 323–389 (1992)
Gurevich, Y.: The decision problem for the logic of predicates and of operations. Algebra and Logic 8, 160–174 (1969), doi:10.1007/BF02306690
Hodgson, K., Slaney, J.: Tptp, casc and the development of a semantically guided theorem prover. AI Commun. 15, 135–146 (2002)
Liang, C., Miller, D.: Focusing and Polarization in Intuitionistic Logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 451–465. Springer, Heidelberg (2007), doi: 10.1007/978-3-540-74915-8
Lynch, C.: Unsound Theorem Proving. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 473–487. Springer, Heidelberg (2004), doi: 10.1007/978-3-540-30124-0_36
Okee, J.: A semantical proof of the undecidability of the monadic intuitionistic predicate calculus of the first order. Notre Dame J. Formal Logic 16, 552–554 (1975)
Pfenning, F., Schürmann, C.: System Description: Twelf - A Meta-Logical Framework for Deductive Systems. In: Ganzinger, H. (ed.) CADE-16. LNCS (LNAI), vol. 1632, pp. 202–206. Springer, Heidelberg (1999)
Raths, T., Otten, J., Kreitz, C.: The iltp problem library for intuitionistic logic. Journal of Automated Reasoning 38, 261–271 (2007)
Riazanov, A., Voronkov, A.: The design and implementation of vampire. AI Commun. 15(2-3), 91–110 (2002)
Sutcliffe, G.: The tptp problem library and associated infrastructure. Journal of Automated Reasoning 43, 337–362 (2009)
Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS Version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol. 5663, pp. 140–145. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brock-Nannestad, T., Schürmann, C. (2012). Truthful Monadic Abstractions. In: Gramlich, B., Miller, D., Sattler, U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science(), vol 7364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31365-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31365-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31364-6
Online ISBN: 978-3-642-31365-3
eBook Packages: Computer ScienceComputer Science (R0)