Semantic A-translations and Super-Consistency Entail Classical Cut Elimination, LNCS ARCoSS, vol.8312, pp.407-422, 2013. ,
DOI : 10.1007/978-3-642-45221-5_28
Categorical reconstruction of a reduction free normalization proof, Category Theory and Computer Science, pp.182-199, 1995. ,
DOI : 10.1007/3-540-60164-3_27
Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992. ,
DOI : 10.1093/logcom/2.3.297
Resolution in type theory, The Journal of Symbolic Logic, vol.34, issue.03, pp.414-432, 1971. ,
DOI : 10.1073/pnas.49.6.828
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts, Functional and Logic Programming -11th International Symposium, FLOPS 2012 Proceedings, volume 7294 of Lecture Notes in Computer Science, pp.32-46, 2012. ,
DOI : 10.1007/978-3-642-29822-6_6
URL : https://hal.archives-ouvertes.fr/hal-00697241
Algebraic proofs of cut elimination, The Journal of Logic and Algebraic Programming, vol.49, issue.1-2, pp.15-30, 2001. ,
DOI : 10.1016/S1567-8326(01)00009-1
URL : http://doi.org/10.1016/s1567-8326(01)00009-1
Non-elementary speedups between different versions of tableaux, TABLEAUX'95, pp.217-230, 1995. ,
DOI : 10.1007/3-540-59338-1_38
The Lambda Calculus : Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, 1985. ,
Handbook of Mathematical Logic. Studies in Logic and the Foundations of Mathematics, 1982. ,
Normalisation by evaluation, Prospects for Hardware Foundations, ES- PRIT Working Group, pp.117-137, 1998. ,
Reviews.
Oiva Ketonen. Untersuchungen zum Pr??dikatenkalkul.
Annales Academiae Scientiarum Fennicae, series A, I. Mathematica-physica 23. Helsinki
1944, 71 pp., The Journal of Symbolic Logic, vol.10, issue.04, pp.127-130, 1945. ,
DOI : 10.2307/2269018
Automated theorem proving. Artificial intelligence, 1982. ,
The Computability Path Ordering: The End of a Quest, Computer Science Logic, 22nd International Workshop 17th Annual Conference of the EACSL Proceedings, volume 5213 of Lecture Notes in Computer Science, pp.1-14, 2008. ,
DOI : 10.1007/978-3-540-87531-4_1
URL : https://hal.archives-ouvertes.fr/inria-00288209
The Calculus of Algebraic Constructions, Rewriting Techniques and Applications, 1999. ,
DOI : 10.1007/3-540-48685-2_25
URL : https://hal.archives-ouvertes.fr/inria-00105545
The ??-calculus modulo as a universal proof language, Second Workshop on Proof Exchange for Theorem Proving (PxTP), pp.28-43, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00917845
TaMeD: A Tableau Method for Deduction Modulo, Automated Reasoning : Second International Joint Conference, 2004. ,
DOI : 10.1007/978-3-540-25984-8_33
URL : https://hal.archives-ouvertes.fr/hal-01520537
On Constructive Cut Admissibility in Deduction Modulo, TYPES for proofs and programs, pp.33-47, 2006. ,
DOI : 10.1007/978-3-540-74464-1_3
URL : https://hal.archives-ouvertes.fr/hal-01337639
A Semantic Completeness Proof for TaMeD, Lecture Notes in Computer Science, vol.4246, pp.167-181, 2006. ,
DOI : 10.1007/11916277_12
URL : https://hal.archives-ouvertes.fr/hal-01337086
Taming tamed. unpublished, 2008. ,
A syntactic soundness proof for free-variable tableaux with on-the-fly skolemization. unpublished, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01154799
Polarizing Double-Negation Translations, LNCS ARCoSS, vol.8312, pp.182-197, 2013. ,
DOI : 10.1007/978-3-642-45221-5_14
URL : https://hal.archives-ouvertes.fr/hal-00920224
Principles of Superdeduction, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.10-12, 2007. ,
DOI : 10.1109/LICS.2007.37
URL : https://hal.archives-ouvertes.fr/inria-00133557
Orthogonality and Boolean Algebras for Deduction Modulo, Lecture Notes in Computer Science, vol.281, issue.1-2, pp.76-90, 2011. ,
DOI : 10.1007/BFb0064875
URL : https://hal.archives-ouvertes.fr/inria-00563331
Experimenting with Deduction Modulo, Lecture Notes in Computer Science, vol.43, issue.4, pp.162-176, 2011. ,
DOI : 10.1007/978-3-642-02959-2_10
URL : https://hal.archives-ouvertes.fr/hal-01125858
Regaining cut admissibility in deduction modulo using abstract completion, Information and Computation, vol.208, issue.2, pp.140-164, 2010. ,
DOI : 10.1016/j.ic.2009.10.005
URL : https://hal.archives-ouvertes.fr/inria-00132964
Automated deduction in the B set theory using typed proof search and deduction modulo, 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning -Short Presentations, LPAR 2015 of EPiC Series in Computing, pp.42-58, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01204701
A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux, Selected Papers from Automated Deduction in Classical and Non-Classical Logics, pp.109-125, 2000. ,
Classical polarizations yield doublenegation translations, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01354298
A note on the Entscheidungsproblem, The Journal of Symbolic Logic, vol.166, issue.01, pp.40-41, 1936. ,
DOI : 10.1007/BF01475439
From semantics to rules: A machine assisted analysis, CSL, pp.91-105, 1993. ,
DOI : 10.1007/BFb0049326
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.5491
A proof of strong normalization for the theory of constructions using a kripke-like interpretation, Preliminary Proceedings 1st Intl. Workshop on Logical Frameworks, 1990. ,
Logique mathématique, 1993. ,
Models and Proof Normalization, 2009. ,
URL : https://hal.archives-ouvertes.fr/tel-00433165
On completeness of reducibility candidates as a semantics of strong normalization, Logical Methods in Computer Science, vol.8, issue.1, p.2012 ,
DOI : 10.2168/LMCS-8(1:3)2012
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo, Typed Lambda Calculi and Applications, 8th International Conference, pp.102-117, 2007. ,
DOI : 10.1007/978-3-540-73228-0_9
A semantic proof that reducibility candidates entail cut elimination, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.133-148, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00743284
Non-normalisation de ZF. Manuscript, 1974. ,
Normalization and the Yoneda embedding, Mathematical Structures in Computer Science, vol.8, issue.2, pp.153-192, 1998. ,
DOI : 10.1017/S0960129597002508
The permutability of rules in the classical inferential calculus, The Journal of Symbolic Logic, vol.39, issue.04, pp.245-248, 1952. ,
DOI : 10.2307/2266612
Type-Directed Partial Evaluation, Partial Evaluation -Practice and Theory, DIKU 1998 International Summer School, pp.367-411, 1998. ,
DOI : 10.1007/3-540-47018-2_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.291
Proof certification in zenon modulo : When achilles uses deduction modulo to outrun the tortoise with shorter steps, IWIL, 10th International Workshop on the Implementation of Logics, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00909688
Proof compression and certification in zenon modulo, Third Workshop of the Amadeus Project on Proof Compression, 2013. ,
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo, LNCS ARCoSS, vol.8312, pp.274-290, 2013. ,
DOI : 10.1007/978-3-642-45221-5_20
URL : https://hal.archives-ouvertes.fr/hal-00909784
Truth Values Algebras and Proof Normalization, TYPES for proofs and programs, pp.110-124, 2006. ,
DOI : 10.1007/978-3-540-74464-1_8
Polarized deduction modulo, In IFIP Theoretical Computer Science, 2010. ,
DOI : 10.1007/978-3-642-15240-5_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5578
Hol-lambda-sigma : an intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science, vol.11, pp.1-25, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00098847
Binding Logic: Proofs and Models, Lecture Notes in Computer Science, vol.2514, pp.130-144, 2002. ,
DOI : 10.1007/3-540-36078-6_9
URL : https://hal.archives-ouvertes.fr/inria-00101012
Theorem proving modulo, Journal of Automated Reasoning, vol.31, issue.1, pp.33-72, 2003. ,
DOI : 10.1023/A:1027357912519
URL : https://hal.archives-ouvertes.fr/inria-00077199
A Simple Proof That Super-Consistency Implies Cut Elimination, Lecture Notes in Computer Science, vol.4533, pp.93-106, 2007. ,
DOI : 10.1007/978-3-540-73449-9_9
URL : https://hal.archives-ouvertes.fr/hal-00150697
A Simple Proof that Super-Consistency Implies Cut Elimination, Notre Dame Journal of Formal Logic, vol.53, issue.4, pp.439-456, 2012. ,
DOI : 10.1215/00294527-1722692
URL : https://hal.archives-ouvertes.fr/hal-00150697
Abstract, The Journal of Symbolic Logic, vol.87, issue.04, pp.1289-1316, 2003. ,
DOI : 10.1007/BFb0037116
Arithmetic as a Theory Modulo, Lecture Notes in Computer Science, vol.3467, pp.423-437, 2005. ,
DOI : 10.1007/978-3-540-32033-3_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.6757
Mathematical Intuitionism : Introduction to Proof Theory. Translations of mathematical monographs, 1988. ,
Elements of Intuitionism. Oxford logic guides, 2000. ,
Contraction-free sequent calculi for intuitionistic logic, The Journal of Symbolic Logic, vol.475, issue.03, pp.795-807, 1992. ,
DOI : 10.1007/3-540-54487-9_58
Abstract, The Journal of Symbolic Logic, vol.94, issue.04, pp.1499-1518, 2000. ,
DOI : 10.1007/BF01627506
The Classical Decision Problem, 1997. ,
DOI : 10.1007/978-3-642-59207-2
First Order Logic and Automated Theorem Proving, 1996. ,
DOI : 10.1007/978-1-4612-2360-3
Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinenDenkens, p.1879 ,
Classically and intuitionistically provably recursive functions, Higher Set Theory, pp.21-27, 1978. ,
DOI : 10.1007/BFb0103100
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210, 1934. ,
DOI : 10.1007/BF01201353
Über das Verhaltnis zwischen intuitionistischer une klassischer Logik Archiv für matematische Logik und Grundlagenforschung, pp.119-132, 1974. ,
DOI : 10.1007/bf02015371
A lightweight double-negation translation, 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning -Short Presentations , LPAR 2015, pp.81-93, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01245021
Normalisation by Completeness with Heyting Algebras, Logic for Programming, Artificial Intelligence, and Reasoning -20th International Conference Proceedings, volume 9450 of Lecture Notes in Computer Science, pp.469-482, 2015. ,
DOI : 10.1007/978-3-662-48899-7_33
Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987. ,
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
Proofs and Types, 1989. ,
The liberalized ?-rule in free variable semantic tableaux, Journal of Automated Reasoning, vol.4, issue.2, pp.211-221, 1994. ,
DOI : 10.1007/BF00881956
Automated Deduction and Proof Certification for the B Method, Conservatoire National des Arts et Métiers, 1996. ,
URL : https://hal.archives-ouvertes.fr/tel-01420460
Séquents qu'on calcule, 1995. ,
An analysis of the constructive content of henkin's proof of gödel's completeness theorem, Available on the authors' webpage, 2016. ,
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus, Logic, Language, Information and Computation Proceedings, volume 5514 of Lecture Notes in Computer Science, pp.209-217, 2009. ,
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/inria-00381554
A model-based cut elimination proof. 2nd St-Petersburg Days of Logic and Computability, 2003. ,
Completeness of cut-free sequent calculus modulo Available on the author's web page, 2004. ,
Semantic Cut Elimination in the Intuitionistic Sequent Calculus, Typed Lambda-Calculi and Applications, pp.221-233, 2005. ,
DOI : 10.1007/11417170_17
Resolution is Cut-Free, Journal of Automated Reasoning, vol.15, issue.2, pp.245-276, 2010. ,
DOI : 10.1007/s10817-009-9153-6
URL : https://hal.archives-ouvertes.fr/hal-00743218
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms, Lecture Notes in Computer Science, vol.5213, pp.169-183, 2008. ,
DOI : 10.1007/978-3-540-87531-4_14
Cut elimination in the Intuitionistic Theory of Types with axioms and rewriting cuts, constructively, Festschrift in Honor of Peter B. Andrews on His 70th Birthday, Studies in Logic and the Foundations of Mathematics, pp.101-134, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00912791
Completeness and Cut-elimination in the Intuitionistic Theory of Types--Part 2, Journal of Logic and Computation, vol.20, issue.2, pp.597-602, 2010. ,
DOI : 10.1093/logcom/exp076
URL : https://hal.archives-ouvertes.fr/hal-00917868
Cut elimination in higher-order intuitionistic linear logic. unpublished, 2007. ,
A Shorter Model Theory, 1997. ,
Representation and interaction of proofs in superdeduction modulo. Theses, 2010. ,
URL : https://hal.archives-ouvertes.fr/tel-00553219
Constructive Completeness Proofs and Delimited Control, 2010. ,
URL : https://hal.archives-ouvertes.fr/tel-00529021
Kripke models for classical logic, Annals of Pure and Applied Logic, vol.161, issue.11, pp.1367-1378, 2010. ,
DOI : 10.1016/j.apal.2010.04.007
URL : https://hal.archives-ouvertes.fr/inria-00371959
Untersuchungen zum Prädikatenkalkül, 1944. ,
Introduction to Metamathematics, 1952. ,
Permutability of inferences in Gentzen's calculi LK and LJ. Memoirs of the, pp.1-26, 1952. ,
Mathematical logic, 1967. ,
On the principle of the excluded middle, Mat. Sb, vol.32, pp.646-667, 1925. ,
Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. The Bulletin of Symbolic Logic, pp.405-421, 1996. ,
DOI : 10.2307/421172
Realisability in Classical Logic, Course Notes, 2004. ,
A Higher-Order Logic Programming Language with Constraints, Lecture Notes in Computer Science, vol.2024, pp.108-122, 2001. ,
DOI : 10.1007/3-540-44716-4_7
Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009. ,
DOI : 10.1016/j.tcs.2009.07.041
URL : http://doi.org/10.1016/j.tcs.2009.07.041
On subexponentials, synthetic connectives, and multilevel delimited control, Logic for Programming, Artificial Intelligence, and Reasoning -20th International Conference Proceedings, volume 9450 of Lecture Notes in Computer Science, pp.297-312, 2015. ,
DOI : 10.1007/978-3-662-48899-7_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.2415
Completeness and cut elimination in Church's intuitionistic theory of types, Journal of Logic and Computation, vol.15, pp.821-854, 2005. ,
Higher-Order Logic Programming Languages with Constraints: A Semantics, Lecture Notes in Computer Science, vol.4583, pp.272-289, 2007. ,
DOI : 10.1007/978-3-540-73228-0_20
Eine Darstellung der Intuitionistischen Logik in der Klassischen, Nagoya Mathematical Journal, vol.2, pp.45-64, 1954. ,
DOI : 10.1007/BF01201353
Lattice-valued representation of the cut-elimination theorem, Tsukuba Journal of Mathematics, vol.15, issue.2, pp.509-521, 1991. ,
DOI : 10.21099/tkbjm/1496161672
Foundations for Programming Languages, 1996. ,
Kripke-style models for typed lambda calculus, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.99-124, 1991. ,
DOI : 10.1016/0168-0072(91)90067-V
URL : http://doi.org/10.1016/0168-0072(91)90067-v
Le statut dynamique des axiomes. Des preuves aux modèles, 2013. ,
Sequent calculus proof theory of intuitionistic apartness and order relations, Archive for Mathematical Logic, vol.38, issue.8, pp.521-547, 1999. ,
DOI : 10.1007/s001530050137
Abstract, Bulletin of Symbolic Logic, vol.4, issue.04, pp.418-435, 1998. ,
DOI : 10.2307/420956
Proof systems for lattice theory, Mathematical Structures in Computer Science, vol.14, issue.4, pp.507-526, 2004. ,
DOI : 10.1017/S0960129504004244
Logic for Applications, 1993. ,
Basic narrowing revisited, Journal of Symbolic Computation, vol.7, issue.3-4, pp.295-317, 1989. ,
DOI : 10.1016/S0747-7171(89)80014-8
URL : http://doi.org/10.1016/s0747-7171(89)80014-8
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic, Theoretical Computer Science, vol.227, issue.1-2, pp.333-396, 1999. ,
DOI : 10.1016/S0304-3975(99)00058-4
URL : http://doi.org/10.1016/s0304-3975(99)00058-4
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics, Theoretical Computer Science, vol.281, issue.1-2, pp.471-498, 2002. ,
DOI : 10.1016/S0304-3975(02)00024-5
Completeness and Hauptsatz for second order logic1, Theoria, vol.23, issue.3, pp.246-258, 1964. ,
DOI : 10.1111/j.1755-2567.1967.tb00622.x
Hauptsatz for higher order logic, The Journal of Symbolic Logic, vol.25, issue.03, pp.452-457, 1968. ,
DOI : 10.1090/S0002-9904-1966-11611-7
The mathematics of metamathematics. PWN, Polish Scientific Publishers, The Principles of Mathematics, 1903. ,
Rewriting Modulo ?? in the ????-Calculus Modulo, Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages : Theory and Practice, LFMTP 2015, pp.87-101, 2015. ,
DOI : 10.4204/EPTCS.185.6
URL : https://hal.archives-ouvertes.fr/hal-01176715
Typechecking in the ??-Calculus Modulo : Theory and Practice, Thèse de doctorat, 2015. ,
URL : https://hal.archives-ouvertes.fr/tel-01299180
Continuation-passing style and strong normalisation for intuitionistic sequent calculi, Logical Methods in Computer Science, vol.5, issue.2, 2009. ,
Structural Logical Relations, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.24-27, 2008. ,
DOI : 10.1109/LICS.2008.44
Schlu???weisen-Kalk???le der Pr???dikatenlogik, Mathematische Annalen, vol.122, issue.1, pp.47-65, 1950. ,
DOI : 10.1007/BF01342950
Syntactical and semantical properties of simple type theory, The Journal of Symbolic Logic, vol.15, issue.04, pp.305-326, 1960. ,
DOI : 10.1007/BF01969991
Proof Theory. Grundlehren der matematischen Wissenschaften, 1977. ,
First-Order Logic, 1968. ,
DOI : 10.1201/b10689-23
A Model-Based Completeness Proof of Extended Narrowing and Resolution, First International Joint Conference on Automated Reasoning (IJCAR-2001), pp.195-210, 2001. ,
DOI : 10.1007/3-540-45744-5_15
URL : https://hal.archives-ouvertes.fr/inria-00100440
Collected Papers of Gerhard Gentzen. Studies in Logic and the Foundation of Mathematics, 1969. ,
A nonconstructive proof of Gentzen's Hauptsatz for second order predicate logic, Bulletin of the American Mathematical Society, vol.72, issue.6, pp.980-983, 1966. ,
DOI : 10.1090/S0002-9904-1966-11611-7
A proof of cut-elimination theorem in simple type-theory, Journal of the Mathematical Society of Japan, vol.19, issue.4, pp.399-410, 1967. ,
DOI : 10.2969/jmsj/01940399
Proof Theory, 1987. ,
Lectures on Linear Logic, volume 30 of CSLI Lecture Notes. Center for the Study of Language and Information, 1992. ,
On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, issue.43, pp.230-265, 1937. ,
Classical Logic and Computation, 2000. ,
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure, Proceedings of TLCA, pp.415-430, 2001. ,
DOI : 10.1007/3-540-45413-6_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.1306
From Frege to Gödel : A Source Book in Mathematical Logic, 1879-1931. Source books in the history of the sciences, 1967. ,
An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic, The Journal of Symbolic Logic, vol.41, issue.1, pp.159-166, 1976. ,
DOI : 10.2307/2272955
Handbook of Tableau Methods, chapter Tableaux for Intutionistic Logics, pp.255-296, 1999. ,