English
Related papers

Related papers: A Concrete Final Coalgebra Theorem for ZF Set Theo…

200 papers

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…

Logic · Mathematics 2023-10-18 Yurii Khomskii , Hrafn Valtýr Oddsson

Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…

Logic in Computer Science · Computer Science 2016-07-27 Stefan Milius , Lutz Schröder , Thorsten Wißmann

The foundations of mathematics have long been considered settled by the Zermelo-Fraenkel-Choice axioms. But set theory abounds in models with different truths and even classical questions such as the measurability of projective sets can…

Logic · Mathematics 2026-05-06 David Mumford , Sy-David Friedman

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

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…

Number Theory · Mathematics 2017-09-04 Anton Deitmar

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of…

Logic in Computer Science · Computer Science 2020-01-23 Murdoch J. Gabbay

We define an ordinalized version of Kleene's realizability interpretation of intuitionistic logic by replacing Turing machines with Koepke's ordinal Turing machines (OTMs), thus obtaining a notion of realizability applying to arbitrary…

Logic · Mathematics 2024-03-18 Merlin Carl

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

Logic · Mathematics 2024-04-09 Joel David Hamkins

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

Logic · Mathematics 2022-02-07 Andrew Swan

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

Logic · Mathematics 2019-07-31 Paul K. Gorbow

What is the slightest modification of ZF to add a complement-axiom? The answer in my Ph.D. thesis 1971 was ZF'': Zermelo-Fraenkel with replacement for only well-founded domains and an omega-axiom. In 1974, Alonzo Church published a similar…

Logic · Mathematics 2008-08-01 Werner DePauli-Schimanovich

On a real ($\mathbb F=\mathbb R$) or complex ($\mathbb F=\mathbb C$) analytic connected 2-manifold $M$ with empty boundary consider two vector fields $X,Y$. We say that $Y$ {\it tracks} $X$ if $[Y,X]=fX$ for some continuous function…

Dynamical Systems · Mathematics 2016-06-28 Morris W. Hirsch , F. -J. Turiel

Let A be a commutative noetherian ring. Call a functor <<commutative A-algebras>> --> <<sets>> coherent if it can be built up (via iterated finite limits) from functors of the form B \mapsto M tensor_A B, where M is a f.g. A-module. When…

alg-geom · Mathematics 2015-06-30 David B. Jaffe

We construct a locally profinite set of cardinality $\aleph_{\omega}$ with infinitely many first cohomology classes of which any distinct finite product does not vanish. Building on this, we construct the first example of a nondescendable…

Logic · Mathematics 2024-11-12 Ko Aoki

We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…

Logic · Mathematics 2012-09-17 Benno van den Berg

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban