Finite Basis for Fragments of Tarski's Relation Algebra Preserving Functions and Homomorphisms
The homomorphism-safe fragment of Tarski's relation algebra is finitely generated, but the function-preserving and total-function-preserving fragments are not finitely generated. The forward function-preserving and local injective-function-preserving fragments are finitely generated.
Semantic Proof of Generalised Cut Elimination for Deep Inference System MAV
Every proof in the deep inference system MAV can be normalized to a cut-free proof using a semantic model construction.
Teaching Higher-Order Logic Using Isabelle: A Gentle Introduction to Formal Reasoning in Proof Assistants
The authors present a formalization of higher-order logic in the Isabelle proof assistant, building directly on the foundational Isabelle/Pure framework. The goal is to provide a gentle introduction to higher-order logic and proof assistants, without the complexity of Isabelle/HOL.
Recursive Refutability: Exploring the Connections between Provability and Refutability Predicates in Formal Logic
The article investigates the interactive links between the recursive predicates of provability (Pf) and refutability (Rf) defined within the same recursive status, providing insights into the nature of undecidability and indeterminacy in formal systems.
Modeling Multiplicative Linear Logic via Deep Inference
The core message of this paper is to explore how coherence and categorical semantics hold invariance by transformation procedures between the sequent calculus and deep inference systems for multiplicative linear logic (MLL-).
© 2024 by Linnk AI