English
Related papers

Related papers: G\"odel incompleteness through Arithmetic Universe…

200 papers

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

Logic · Mathematics 2010-11-24 Shira Kritchman , Ran Raz

These notes were written for a presentation given at the university Paris VII in January 2012. The goal was to explain a proof of a famous theorem by P. Deligne about coherent topoi (coherent topoi have enough points) and to show how this…

Logic · Mathematics 2013-09-03 Benjamin Frot

The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Aristotelis Panagiotopoulos , George Sparling , Marios Christodoulou

In this work, we analyze the structure of the category of partial representations of a finite group $G$ as a multifusion category, providing an alternative way to describe simple objects and their tensor products. We describe the…

Representation Theory · Mathematics 2026-02-16 Arthur R. Alves Neto , Eliezer Batista , Javier Méndez

Let O be a topological (colored) operad. The Lurie infinity-category of O-algebras with values in (infinity-category of) complexes is compared to the infinity-category underlying the model category of (classical) dg O-algebras. This can be…

Quantum Algebra · Mathematics 2015-09-21 V. Hinich

We prove that every categorical model of dependent type theory with dependent sums and products, intensional identity types and univalent universes presents via its $\infty$-localisation an elementary $\infty$-topos, that is, a finitely…

Category Theory · Mathematics 2026-04-30 Maximilian Petrowitsch

We discuss the category $\cal I$ of level zero integrable representations of loop algebras and their generalizations. The category is not semisimple and so one is interested in its homological properties. We begin by looking at some…

Representation Theory · Mathematics 2010-09-08 Vyjayanthi Chari

Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that…

Logic · Mathematics 2014-10-14 Matthew P. Szudzik

In this paper we deal with Grothendieck's interpretation of Artin's interpretation of Galois's Galois Theory (and its natural relation with the fundamental group and the theory of coverings) as he developed it in Expose V, section 4,…

Category Theory · Mathematics 2007-05-23 E. J. Dubuc , C. Sanchez de la Vega

The aim of this paper is to review and complete the study of geodesics on G\"odel type spacetimes initiated in [8] and improved in [2] of the References. In particular, we prove some new results on geodesic connectedness and geodesic…

Differential Geometry · Mathematics 2012-01-11 Rossella Bartolo , Anna Maria Candela , José Luis Flores

Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to…

Logic · Mathematics 2012-02-16 Jacob Vosmaer

We give a complete and careful proof of Quillen's theorem on the existence of the standard model category structure on the category of topological spaces. We do not assume any familiarity with model categories.

Algebraic Topology · Mathematics 2017-10-24 Philip S. Hirschhorn

In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…

Logic · Mathematics 2011-12-20 Graham Leach-Krouse

Reasoning in the 2-category Con of contexts, certain sketches for arithmetic universes (i.e. list arithmetic pretoposes; AUs), is shown to give rise to base-independent results of Grothendieck toposes, provided the base elementary topos has…

Category Theory · Mathematics 2017-01-18 Steven Vickers

We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a…

Logic in Computer Science · Computer Science 2023-01-30 Matt Earnshaw , James Hefford , Mario Román

We study Torelli-type theorems in the Zariski topology for varieties of dimension at least 2, over arbitrary fields. In place of the Hodge structure, we use the linear equivalence relation on Weil divisors. Using this setup, we prove a…

Algebraic Geometry · Mathematics 2021-01-14 János Kollár , Max Lieblich , Martin Olsson , Will Sawin

This paper studies the homotopy theory of algebras and homotopy algebras over an operad. It provides an exhaustive description of their higher homotopical properties using the more general notion of morphisms called infinity-morphisms. The…

Algebraic Topology · Mathematics 2016-02-09 Bruno Vallette

We prove the conjecture that any Grothendieck $(\infty,1)$-topos can be presented by a Quillen model category that interprets homotopy type theory with strict univalent universes. Thus, homotopy type theory can be used as a formal language…

Algebraic Topology · Mathematics 2019-04-30 Michael Shulman

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…

Logic · Mathematics 2007-05-23 Peter Koepke
‹ Prev 1 4 5 6 7 8 10 Next ›