English
Related papers

Related papers: A common Misconception about the Categorical Arith…

200 papers

By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…

We formally define a "mathematical object" and "set". We then argue that expressions such as "(Ax)F(x)", and "(Ex)F(x)", in an interpretation M of a formal theory P, may be taken to mean "F(x) is true for all x in M", and "F(x) is true for…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

Lindstr\"om theorem obviously fails as a characterization of $\mathcal{L}_{\omega \omega}^{-} $, first-order logic without identity. In this note we provide a fix: we show that $\mathcal{L}_{\omega \omega}^{-} $ is \emph{maximal} among…

Logic · Mathematics 2022-12-07 Guillermo Badia , Xavier Caicedo , Carles Noguera

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

Logic · Mathematics 2024-07-16 Lev D. Beklemishev , Yunsong Wang

Grothendieck Duality -- the theory of the twisted inverse image pseudofunctor (-)^! over a suitable category of scheme-maps -- can be developed concretely, with emphasis on explicit constructions, or abstractly, with emphasis on…

Algebraic Geometry · Mathematics 2025-03-25 Joseph Lipman

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella

First, we define some concepts similar to the local compactoidity or the c-compactness, and study relationships between these concepts and the original ones. As a result, we find a characterization of the local compactoidity when its…

Functional Analysis · Mathematics 2025-02-03 Kosuke Ishizuka

Transcript of G.J. Chaitin's 2 March 2000 Carnegie Mellon University School of Computer Science Distinguished Lecture. The notion of randomness is taken from physics and applied to pure mathematics in order to shed light on the…

Chaotic Dynamics · Physics 2007-05-23 G. J. Chaitin

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

Dynamical Systems · Mathematics 2016-02-29 S. Saito , N. Saitoh , T. Hatanaka , Y. Wakimoto , T. Yumibayashi

Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…

Category Theory · Mathematics 2010-02-05 M. R. Gould

First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…

Logic · Mathematics 2015-04-21 Matthias Baaz , Norbert Preining , Richard Zach

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

Mathematical Physics · Physics 2015-06-05 E Celeghini , Mariano A del Olmo

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…

Logic in Computer Science · Computer Science 2021-04-30 Antonis Achilleos , Mathias Ruggaard Pedersen

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

We point out that some questions in quantum field theory are undecidable in a precise mathematical sense. More concretely, it will be demonstrated that there is no algorithm answering whether a given 2d supersymmetric Lagrangian theory…

High Energy Physics - Theory · Physics 2024-11-22 Yuji Tachikawa

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

The existence of incompatible measurements is often believed to be a feature of quantum theory which signals its inconsistency with any classical worldview. To prove the failure of classicality in the sense of Kochen-Specker…

Quantum Physics · Physics 2024-04-05 John H. Selby , David Schmid , Elie Wolfe , Ana Belén Sainz , Ravi Kunjwal , Robert W. Spekkens

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)

Logic · Mathematics 2009-09-25 Thomas Jech

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

Group Theory · Mathematics 2008-04-02 Laurent Bartholdi
‹ Prev 1 8 9 10 Next ›