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 ...
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...
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
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...
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...