Definitions of new symbols merely abbreviate expressions in logical frameworks, and no new facts (regarding previously defined symbols) should hold because of a new definition. In Isabelle/HOL, definable symbols are types and constants. The latter may be ad-hoc overloaded, i.e. have different definitions for non-overlapping types. We prove that symbols that are independent of a new definition may keep their interpretation in a model extension. This work revises our earlier notion of model-theoretic conservative extension and generalises an earlier model construction. We obtain consistency of theories of definitions in higher-order logic (HOL) with ad-hoc overloading as a corollary. Our results are mechanised in the HOL4 theorem prover
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
Definitions of new symbols merely abbreviate expressions in logical frameworks, and no new facts (re...
Many logical frameworks allow extensions, i.e. the introduction of new symbols, by definitions. Diff...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Non-terminating (dependencies of) definitions can lead to logical contradictions, for example when d...
The interactive theorem prover Isabelle/HOL is based on well understood Higher-Order Logic (HOL), wh...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Definitions are traditionally considered to be a safe mechanism for introducing concepts on top of a...
We introduce a new formalization of Higher-Order-Logic (abbreviated Hol), which we baptized Formath,...
Type classes and overloading are shown to be independent concepts that can both be added to simple ...
We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC)-a syst...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...
Definitions of new symbols merely abbreviate expressions in logical frameworks, and no new facts (re...
Many logical frameworks allow extensions, i.e. the introduction of new symbols, by definitions. Diff...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Non-terminating (dependencies of) definitions can lead to logical contradictions, for example when d...
The interactive theorem prover Isabelle/HOL is based on well understood Higher-Order Logic (HOL), wh...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Definitions are traditionally considered to be a safe mechanism for introducing concepts on top of a...
We introduce a new formalization of Higher-Order-Logic (abbreviated Hol), which we baptized Formath,...
Type classes and overloading are shown to be independent concepts that can both be added to simple ...
We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC)-a syst...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
Types in higher-order logic (HOL) are naturally interpreted as nonempty sets. This intuition is refl...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
Types in Higher-Order Logic (HOL) are naturally interpreted as nonempty sets—this intuition is refle...