English
Related papers

Related papers: The Potential in Frege's Theorem

200 papers

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…

Computer Science and Game Theory · Computer Science 2023-04-11 Yannai A. Gonczarowski , Scott Duke Kominers , Ran I. Shorrer

The problem of induction has persisted since Hume exposed the logical gap between repeated observation and universal inference. Traditional attempts to resolve it have oscillated between two extremes: the probabilistic optimism of Laplace…

Other Statistics · Statistics 2025-11-06 Tommaso Costa

The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…

General Physics · Physics 2023-06-08 Biao Wu

G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…

Logic · Mathematics 2020-07-02 Joachim Derichs

We consider a piecewise analytic expanding map f: [0,1]-> [0,1] of degree d which preserves orientation, and an analytic positive potential g: [0,1] -> R. We address the analysis of the following problem: for a given analytic potential beta…

Dynamical Systems · Mathematics 2011-01-20 Gonzalo Contreras , Artur O. Lopes , Elismar R. Oliveira , Daniel Smania

Denotational models of type theory, such as set-theoretic, domain-theoretic, or category-theoretic models use (actual) infinite sets of objects in one way or another. The potential infinite, seen as an extensible finite, requires a dynamic…

Logic in Computer Science · Computer Science 2024-07-02 Matthias Eberl

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

Logic · Mathematics 2025-11-05 Toby Meadows

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Logic in Computer Science · Computer Science 2018-08-16 Daniel Leivant

A description of physical reality in which wholeness is the foundation is discussed along with the motivation for such an attempt. As a possible mathematical framework within which a physical theory based on wholeness may be expressed,…

General Physics · Physics 2015-06-26 Barbara Piechocinska

The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…

Computational Complexity · Computer Science 2024-06-14 Sebastian Oberhoff

Although Bolzano's concept of the continuum has gradually evolved, the basis remained the same: the continuum as an infinite class of points arranged in such a way that the so-called \emph{Bolzano completeness} holds. Bolzano realized over…

History and Overview · Mathematics 2025-08-12 Kateřina Trlifajová

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Logic in Computer Science · Computer Science 2024-05-22 Michael Benedikt , Ehud Hrushovski

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

Logic · Mathematics 2026-01-14 Morenikeji Neri , Nicholas Pischke

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

Logic · Mathematics 2013-04-03 Fredrik Engström , Juha Kontinen , Jouko Väänänen

We study rational remainders associated with gluon amplitudes in gauge theories coupled to matter in arbitrary representations. We find that these terms depend on only a small number of invariants of the matter-representation called…

High Energy Physics - Theory · Physics 2011-02-08 Shailesh Lal , Suvrat Raju

The no-supervenience theorem limits the capacity of physicalist theories to provide a comprehensive account of human consciousness. The proof of the theorem is difficult to formalize because it relies on both alethic and epistemic notions…

Neurons and Cognition · Quantitative Biology 2024-11-13 Cathy M Reason

An alternative mathematics based on qualitative plurality of finiteness is developed to make non-standard mathematics independent of infinite set theory. The vague concept "accessibility" is used coherently within finite set theory whose…

General Mathematics · Mathematics 2012-06-14 Toru Tsujishita

The concept of infinity took centuries to achieve recognized status in the field of mathematics, despite the fact that it was implicitly present in nearly all mathematical endeavors. Here I explore the idea that a similar development might…

History and Philosophy of Physics · Physics 2016-08-25 Don Perlis

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

Logic in Computer Science · Computer Science 2015-07-01 Luc Segoufin , Balder ten Cate