English
Related papers

Related papers: A model of second-order arithmetic satisfying AC b…

200 papers

In this paper we study the notion of strong non-reflection, and its contrapositive weak reflection. We say theta strongly non-reflects at lambda iff there is a function F: theta ---> lambda such that for all alpha < theta with cf(alpha)=…

Logic · Mathematics 2009-09-25 James Cummings , Mirna Džamonja , Saharon Shelah

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

In cognitive science, behaviour is often separated into two types. Reflexive control is habitual and immediate, whereas reflective is deliberative and time consuming. We examine the argument that Hierarchical Predictive Coding (HPC) can…

Artificial Intelligence · Computer Science 2021-09-03 Paul F. Kinghorn , Beren Millidge , Christopher L. Buckley

The representation of mathematical objects in terms of (more) basic ones is part and parcel of (the foundations of) mathematics. In the usual foundations of mathematics, i.e. $\textsf{ZFC}$ set theory, all mathematical objects are…

Logic · Mathematics 2022-10-19 Sam Sanders

This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi, Bezem & Coquand [1], T. Streicher has shown [10], by means of their bar recursion operator, that the…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

Via extensive Monte Carlo simulations along with systematic analyses of corrections to scaling, we estimate the order parameter critical exponent $\beta$ of absorbing phase transitions in systems with two symmetric absorbing states. The…

Statistical Mechanics · Physics 2020-05-18 Su-Chan Park

First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic. In this paper, we argue that the capabilities of FOMC algorithms to date are limited by their…

Logic in Computer Science · Computer Science 2023-06-08 Paulius Dilkas , Vaishak Belle

A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…

Logic · Mathematics 2008-12-18 Chantal Berline , Giulio Manzonetto , Antonio Salibra

We study a Brownian motion with drift in a wedge of angle $\beta$ which is obliquely reflected on each edge along angles $\varepsilon$ and $\delta$. We assume that the classical parameter $\alpha=\frac{\delta+\varepsilon - \pi}{\beta}$ is…

Probability · Mathematics 2024-09-30 Jules Flin , Sandro Franceschi

We analyze standard theoretical models of solar energy conversion developed to study solar cells and photosynthetic systems. We show that the assumption that the energy transfer to the reaction center/electric circuit is through a decay…

Quantum Physics · Physics 2017-01-31 David Gelbwaser-Klimovsky , Alán Aspuru-Guzik

Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…

Logic · Mathematics 2024-11-26 Tom Benhamou , Dima Sinapova

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…

Logic · Mathematics 2021-01-20 Matteo Viale

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

Logic · Mathematics 2025-06-12 Lorenzo Carlucci , Leonardo Mainardi , Konrad Zdanowski

There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…

Logic in Computer Science · Computer Science 2018-04-04 Valentin Blot

There is a model of ZF with a $\Delta^1_3$ definable Hamel basis in which $AC_\omega(R)$ fails.

Logic · Mathematics 2019-02-08 Vladimir Kanovei , Ralf Schindler

In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.

Logic · Mathematics 2013-04-11 Toshiyasu Arai

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery

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

This paper presents a reverse mathematical analysis of several forms of the sorites paradox. We first illustrate how traditional formulations are reliant on H\"older's Representation Theorem for ordered Archimedean groups. While this is…

Logic · Mathematics 2025-10-15 Walter Dean , Sam Sanders