Eigenvariables, bracketing and the decidability of positive minimal predicate logic

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 193-208

  Dowek, Gilles ^a   Jiang, Ying ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

Bound variable; Decidability; Minimal logic; Positive quantifier; Sequent calculus; System F

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; THEOREM PROVING;

BOUND VARIABLE; MINIMAL LOGIC; POSITIVE QUANTIFIER; SEQUENT CALCULUS; SYSTEM F;

LOGIC PROGRAMMING;

EID: 33746617521     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.053     Document Type: Article

References (9)

1. de Bruijn N.G. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math. 34 5 (1972) 381-392
2. Dowek G., Hardin Th., and Kirchner C. HOL-lambda-sigma: an intentional first-order expression of higher-order logic. Math. Structures Comput. Sci. 11 (2001) 1-25
3. Dowek G., Hardin Th., and Kirchner C. Theorem proving modulo. J. Automat. Reason. 31 (2003) 33-72
4. G. Dowek, Y. Jiang, Eigenvariables, Bracketing and the Decidability of Positive Minimal Intuitionistic Logic, Electronic Notes in Theoretical Computer Science, Vol. 85, no. 7, 2003.
5. Dyckhoff R. Contraction-free sequent calculi for intuitionistic logic. J. Symbolic Logic 57 3 (1992) 795-807
6. Y. Jiang, Positive Types in System F, Informal Proc. of the Logic Colloquium, Paris, 2000.
7. Kleene S.C. Introduction to Metamathematics (1952), North-Holland, Amsterdam
8. Löb M.H. Embedding first-order predicate logic in fragments of intuitionistic logic. J. Symbolic Logic 41 4 (1976) 705-718
9. Minc G.E., and Mints G.E. Solvability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers. Steklov Inst. 98 (1968) 135-145