相关论文: A Normalizing Intuitionistic Set Theory with Inacc…
Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…
We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory,…
Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…
Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…
In recent years the question of whether adding the limited principle of omniscience, LPO, to constructive Zermelo-Fraenkel set theory, CZF, increases its strength has arisen several times. As the addition of excluded middle for atomic…
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $\mathbf{InfEx}_{\cong}$, consisting of the…
In this paper we consider the problem of building rich categories of setoids, in standard intensional Martin-L\"of type theory (MLTT), and in particular how to handle the problem of equality on objects in this context. Any…
Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Axiom of Fusion to Zermelo-Fraenkel set theory. In IST, Continuum Hypothesis is a theorem, Axiom of Choice is a theorem, Skolem paradox does…
We introduce the forcing model of IZFA (Intuitionistic Zermelo-Fraenkel set theory with Atoms) for every Grothendieck topology and prove that the topos of sheaves on every site is equivalent to the category of 'sets in this forcing model'.
We introduce $\mathsf{LEM}$, a type-assignment system for the linear $ \lambda $-calculus that extends second-order $\mathsf{IMLL}_2$, i.e., intuitionistic multiplicative Linear Logic, by means of logical rules that weaken and contract…
The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…
In many axiomatic set theories, G\"odel's constructible universe $L$ is known as an inner model, that is, a definable class satisfying the same axioms (and containing the same ordinals). This gives a trivial proof that adding the axiom $V =…
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…
We prove some results about the model theory of fields with a derivation of the Frobenius map, especially that the model companion of this theory is axiomatizable by axioms used by Wood in the case of the theory $\operatorname{DCF}_p$ and…
A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…