Add to ORKGWe define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the λΠ-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions
Applications in software verification often require determining the satisfiability of first-order fo...
International audienceTwo main lines have been adopted to prove the cut elimination theorem: the syn...
Communicated by (xxxxxxxxxx) We identify sufficient conditions to automatically establish the termin...
We define a notion of model for the lambda Pi-calculus modulo theory and prove a soundness theorem. ...
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then...
International audienceWe give a simple and direct proof that super-consistency implies the cut elimi...
Abstract. Deduction modulo is an extension of first-order predicate logic where axioms are replaced ...
In the recent past, the reduction-based and the model-based methods to prove cut elimination have co...
AbstractIn the recent past, the reduction-based and the model-based methods to prove cut elimination...
The λΠ-calculus modulo theory is an extension of simply typed λ-calculus with dependent types and us...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract We give a simple and direct proof that super-consistency im-plies the cut elimination prope...
Abstract. We show that if a theory R defined by a rewrite system is super-consistent, the classical ...
We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
Applications in software verification often require determining the satisfiability of first-order fo...
International audienceTwo main lines have been adopted to prove the cut elimination theorem: the syn...
Communicated by (xxxxxxxxxx) We identify sufficient conditions to automatically establish the termin...
We define a notion of model for the lambda Pi-calculus modulo theory and prove a soundness theorem. ...
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then...
International audienceWe give a simple and direct proof that super-consistency implies the cut elimi...
Abstract. Deduction modulo is an extension of first-order predicate logic where axioms are replaced ...
In the recent past, the reduction-based and the model-based methods to prove cut elimination have co...
AbstractIn the recent past, the reduction-based and the model-based methods to prove cut elimination...
The λΠ-calculus modulo theory is an extension of simply typed λ-calculus with dependent types and us...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract We give a simple and direct proof that super-consistency im-plies the cut elimination prope...
Abstract. We show that if a theory R defined by a rewrite system is super-consistent, the classical ...
We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
Applications in software verification often require determining the satisfiability of first-order fo...
International audienceTwo main lines have been adopted to prove the cut elimination theorem: the syn...
Communicated by (xxxxxxxxxx) We identify sufficient conditions to automatically establish the termin...