FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
automated theorem proving	System Demonstration: The Higher-Order Prover Leo-III
B
Backtracking	Pseudo-Propositional Logic
C
classical higher-order logic	System Demonstration: The Higher-Order Prover Leo-III
Connection-based proof-search	Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic
counterexamples	Evidence Extraction from Parameterised Boolean Equation Systems
D
deontic logis	System Demonstration: The Higher-Order Prover Leo-III
F
fixpoint logic	Evidence Extraction from Parameterised Boolean Equation Systems
focused sequent calculus	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
focused sequent calculus for first-order modal logic	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
H
higher-order logic programming	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
I
Infinite-valued logic	Formalization of a Paraconsistent Infinite-Valued Logic
Isabelle/HOL	Formalization of a Paraconsistent Infinite-Valued Logic
L
Labelled proof-systems	Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic
labelled sequent calculi	Labelled Calculi for QMLs with Non-Rigid and Non-Denoting Terms
lambda prolog	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
linear logic	Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic
M
modal logic	System Demonstration: The Higher-Order Prover Leo-III
modal mu calculus	Evidence Extraction from Parameterised Boolean Equation Systems
N
non-denoting terms	Labelled Calculi for QMLs with Non-Rigid and Non-Denoting Terms
non-rigid terms	Labelled Calculi for QMLs with Non-Rigid and Non-Denoting Terms
P
Paraconsistent logic	Formalization of a Paraconsistent Infinite-Valued Logic
parameterised Boolean equation systems	Evidence Extraction from Parameterised Boolean Equation Systems
proof assistant	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
propositional logic	Pseudo-Propositional Logic
Q
quantified modal logic	An Outline for Simple Semi-automated Proof Assistants for First-order Modal Logics
quantified modal logics	Labelled Calculi for QMLs with Non-Rigid and Non-Denoting Terms
S
SAT problem	Pseudo-Propositional Logic
structural rules	Labelled Calculi for QMLs with Non-Rigid and Non-Denoting Terms

Disclaimer | Powered by EasyChair Smart Program