CADE
1992
Springer
13 years 8 months ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
CADE
1992
Springer
13 years 8 months ago
1992
Springer
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
CADE
1992
Springer
13 years 8 months ago
1992
Springer
Tableau
CADE
1994
Springer
13 years 8 months ago
1994
Springer
