English
Related papers

Related papers: Equivariant ZFA and the foundations of nominal tec…

200 papers

In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…

Logic · Mathematics 2019-08-08 Arieh Lev

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…

Probability · Mathematics 2010-12-10 Gert de Cooman , Erik Quaeghebeur

We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…

Artificial Intelligence · Computer Science 2017-03-07 Arthur Van Camp , Gert de Cooman

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…

Logic · Mathematics 2023-06-22 Benedikt Ahrens , Peter LeFanu Lumsdaine , Vladimir Voevodsky

The concept of definability of physical fields within a set-theoretical foundation is introduced. We propose an axiomatic set theory and show the Schroedinger equation and, more generally, a nonlinear sigma model come naturally out of the…

Mathematical Physics · Physics 2007-05-23 D. J. BenDaniel

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

Logic in Computer Science · Computer Science 2025-10-22 Tomáš Jakl , Dan Marsden , Nihil Shah

Nominal techniques have been praised for their ability to formalize grammars with binding structures closer to their informal developments. At its core, there lies the definition of nominal sets, which capture the notion of name…

Logic in Computer Science · Computer Science 2025-10-01 Fabrício Sanches Paranhos , Daniel Ventura

We present Voevodsky's construction of a model of univalent type theory in the category of simplicial sets. To this end, we first give a general technique for constructing categorical models of dependent type theory, using universes to…

Logic · Mathematics 2026-02-06 Chris Kapulkin , Peter LeFanu Lumsdaine

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…

General Mathematics · Mathematics 2007-05-23 Kannan Nambiar

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple,…

Logic in Computer Science · Computer Science 2015-07-01 James Cheney

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…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

By Tzouvaras, a set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD$\subseteq$HNT$\subseteq$V…

Logic · Mathematics 2021-11-16 Vladimir Kanovei , Vassily Lyubetsky

In this article the author claims that there is a paradigm shift from ZFC to NFUM and further to NACT - due to philosophical reasons, not mathematical ones. The goal is to construct systems where every "Not-Properclass" is a set! With help…

Logic · Mathematics 2008-07-31 Werner DePauli-Schimanovich

It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…

Logic · Mathematics 2022-10-25 Todd Schmid

In this article we give an introduction to the Fock quantization of the Maxwell field. At the classical level, we treat the theory in both the covariant and canonical phase space formalisms. The approach is general since we consider…

Physics Education · Physics 2007-05-23 Alejandro Corichi

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…

Logic · Mathematics 2012-02-17 Robert A. Van Wesep

The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…

Logic · Mathematics 2021-07-27 Zuhair Al-Johar

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

Logic in Computer Science · Computer Science 2023-04-26 Tomáš Jakl , Dan Marsden , Nihil Shah

Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the presheaf-based perspective is its elegant syntax-free…

Logic in Computer Science · Computer Science 2026-02-13 Fabian Lenke , Stefan Milius , Henning Urbat