394 research outputs found
Lower End of the Linial-Post Spectrum
We show that recognizing axiomatizations of the Hilbert-style calculus containing only the axiom a -> (b -> a) is undecidable (a reduction from the Post correspondence problem is formalized in the Lean theorem prover). Interestingly, the problem remains undecidable considering only axioms which, when seen as simple types, are principal for some lambda-terms in beta-normal form. This problem is closely related to type-based composition synthesis, i.e. finding a composition of given building blocks (typed terms) satisfying a desired specification (goal type).
Contrary to the above result, axiomatizations of the Hilbert-style calculus containing only the axiom a -> (b -> b) are recognizable in linear time
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau
calculi. Given a specification of the formal semantics of a logic, the method
generates a set of tableau inference rules that can then be used to reason
within the logic. The method guarantees that the generated rules form a
calculus which is sound and constructively complete. If the logic can be shown
to admit finite filtration with respect to a well-defined first-order semantics
then adding a general blocking mechanism provides a terminating tableau
calculus. The process of generating tableau rules can be completely automated
and produces, together with the blocking mechanism, an automated procedure for
generating tableau decision procedures. For illustration we show the
workability of the approach for a description logic with transitive roles and
propositional intuitionistic logic.Comment: 32 page
Are there Hilbert-style Pure Type Systems?
For many a natural deduction style logic there is a Hilbert-style logic that
is equivalent to it in that it has the same theorems (i.e. valid judgements
with empty contexts). For intuitionistic logic, the axioms of the equivalent
Hilbert-style logic can be propositions which are also known as the types of
the combinators I, K and S. Hilbert-style versions of illative combinatory
logic have formulations with axioms that are actual type statements for I, K
and S. As pure type systems (PTSs)are, in a sense, equivalent to systems of
illative combinatory logic, it might be thought that Hilbert-style PTSs (HPTSs)
could be based in a similar way. This paper shows that some PTSs have very
trivial equivalent HPTSs, with only the axioms as theorems and that for many
PTSs no equivalent HPTS can exist. Most commonly used PTSs belong to these two
classes. For some PTSs however, including lambda* and the PTS at the basis of
the proof assistant Coq, there is a nontrivial equivalent HPTS, with axioms
that are type statements for I, K and S.Comment: Accepted in Logical Methods in Computer Scienc
J-Calc: a typed lambda calculus for intuitionistic justification logic
In this paper we offer a system J-Calc that can be regarded as a typed λ-calculus for the {→, ⊥} fragment of Intuitionistic Justification Logic. We offer different interpretations of J-Calc, in particular, as a two phase proof system in which we proof check the validity of deductions of a theory T based on deductions from a stronger theory T and computationally as a type system for separate compilations. We establish some first metatheoretic result
- …