Related papers: An equiconsistency proof for $\mathrm{CZF} + V = L…
We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large…
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…
In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…
As observed recently by various people the topos $\mathbf{sSet}$ of simplicial sets appears as essential subtopos of a topos $\mathbf{cSet}$ of cubical sets, namely presheaves over the category $\mathbf{FL}$ of finite lattices and monotone…
Logical paradoxes and inconsistent information pose deep challenges in epistemology and the philosophy of logic. Classical systems typically handle contradictions only through external checks or by altering the logical framework, as in…
Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…
In this paper, we present full models for some Paraconsistent Set Theories (PSTs). These models are built over Fidel semantics where they are specific first-order structures in the sense of Model Theory. These structures are known as…
We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…
This paper investigates Voevodsky's univalence axiom in intensional Martin-L\"of type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
This paper presents a tableau calculus for finding a model for a set-satisfiable finite set of formulas of an extended fuzzy logic BL, a fuzzy logic BL with additional Baaz connective and the involutive negation, if such a model exists. The…
In this paper we study intermediate logics between the degree preserving companion of Godel fuzzy logic with an involution and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts.…
A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…
In this paper we prove soundness and completeness of some epistemic extensions of G\"odel fuzzy logic, based on Kripke models in which both propositions at each state and accessibility relations take values in [0,1]. We adopt belief as our…
A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…
Rathjen proved that Aczel's constructive set theory $\mathbf{CZF}$ extended with inaccessible sets of all transfinite orders can be interpreted in Martin-L\"{o}f type theory $\mathbf{MLTT}$ extended with Setzer's Mahlo universe and another…
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…
By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…