Related papers: Quotient completion for the foundation of construc…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
We show that any countable model of a model complete theory has an elementary extension with a "pseudofinite-like" quasidimension that detects dividing.
This is a survey paper on the connection of enriched category theory over a quantale and tropical mathematics. Quantales or complete idempotent semirings, as well as matrices with coefficients in them, are fundamental objects in both…
This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
We formulate a quantum formalism for the statistical mechanical models of discretized field theories on lattices and then show that the discrete version of $\phi^4$ theory on 2D square lattice is complete in the sense that the partition…
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
This paper provides an overview of Lawvere's Fixed-Point Theorem in category theory and aims to detail the universal framework underlying self-reference and recursive structures. First, we rigorously define fundamental concepts - such as…
This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…
Classical varieties were characterized by Lawvere as the categories with effective congruences and a varietal generator: an abstractly finite regular generator which is regularly projective (its hom-functor preserves regular epimorphisms).…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
An age-old controversy in mathematics concerns the necessity and the possibility of constructive proofs. The controversy has been rekindled by recent advances which demonstrate the feasibility of a fully constructive mathematics. This…
We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…
We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…
In this paper we carry the construction of equilogical spaces into an arbitrary category $\mathsf{X}$ topological over $\mathsf{Set}$, introducing the category $\mathsf{X}$-$\mathsf{Equ}$ of equilogical objects. Similar to what is done for…
This dissertation comprises three collections of results, all united by a common theme. The theme is the study of categories via algebraic techniques, considering categories themselves as algebraic objects. This algebraic approach to…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…