Add to ORKGA notion of quantified conditional logics is pro-vided that includes quantification over individual and propositional variables. The former is sup-ported with respect to constant and variable do-main semantics. In addition, a sound and complete embedding of this framework in classical higher-order logic is presented. Using prominent examples from the literature it is demonstrated how this em-bedding enables effective automation of reasoning within (object-level) and about (meta-level) quan-tified conditional logics with off-the-shelf higher-order theorem provers and model finders
Propositional Gödel logic can be extended by quantifiers in different ways, in partic-ular by first-...
Combining Higher Order Abstract Syntax (HOAS) and (co)induction is well known to be problematic. In ...
We present a proof-of-concept prototype of a (constructive variant of an) HOL interactive theorem pr...
At Unilog’2010 I have proposed classical higher-order logic HOL (Church’s type theory [1,9]) as a un...
Logic embeddings provide an elegant means to formalize sophisticated non-classical logics in classic...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
A semantical embedding of input/output logic in classical higher-order logic is presented. This embe...
peer reviewedA sound and complete embedding of conditional logics into classical higher-order logic...
peer reviewedA semantic embedding of quantified conditional logic in classical higher-order logic is...
AbstractIn the field of probabilistic analysis, the concept of conditional probability plays a major...
Originally developed as an algebraic characterisation for quantum mechanics, the algebraic structure...
We present a logic for the specification and analysis of deductive systems. This logic is an extensi...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
We argue that a logic programming language with a higher-order intuitionistic logic as its foundatio...
Propositional Gödel logic can be extended by quantifiers in different ways, in partic-ular by first-...
Combining Higher Order Abstract Syntax (HOAS) and (co)induction is well known to be problematic. In ...
We present a proof-of-concept prototype of a (constructive variant of an) HOL interactive theorem pr...
At Unilog’2010 I have proposed classical higher-order logic HOL (Church’s type theory [1,9]) as a un...
Logic embeddings provide an elegant means to formalize sophisticated non-classical logics in classic...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
A semantical embedding of input/output logic in classical higher-order logic is presented. This embe...
peer reviewedA sound and complete embedding of conditional logics into classical higher-order logic...
peer reviewedA semantic embedding of quantified conditional logic in classical higher-order logic is...
AbstractIn the field of probabilistic analysis, the concept of conditional probability plays a major...
Originally developed as an algebraic characterisation for quantum mechanics, the algebraic structure...
We present a logic for the specification and analysis of deductive systems. This logic is an extensi...
We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inf...
We argue that a logic programming language with a higher-order intuitionistic logic as its foundatio...
Propositional Gödel logic can be extended by quantifiers in different ways, in partic-ular by first-...
Combining Higher Order Abstract Syntax (HOAS) and (co)induction is well known to be problematic. In ...
We present a proof-of-concept prototype of a (constructive variant of an) HOL interactive theorem pr...