Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1101.5894

Vienna Circle and Logical Analysis of Relativity Theory

H. Andréka·J. X. Madarász·I. Németi·P. Németi·G. Székely
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we present some of our school's results in the area of building up relativity theory (RT) as a hierarchy of theories in the sense of logic. We use plain first-order logic (FOL) as in the foundation of mathematics (FOM) and we build on experience gained in FOM. The main aims of our school are the following: We want to base the theory on simple, unambiguous axioms with clear meanings. It should be absolutely understandable for any reader what the axioms say and the reader can decide about each axiom whether he likes it. The theory should be built up from these axioms in a straightforward, logical manner. We want to provide an analysis of the logical structure of the theory. We investigate which axioms are needed for which predictions of RT. We want to make RT more transparent logically, easier to understand, easier to change, modular, and easier to teach. We want to obtain deeper understanding of RT. Our work can be considered as a case-study showing that the Vienna Circle's (VC) approach to doing science is workable and fruitful when performed with using the insights and tools of mathematical logic acquired since its formation years at the very time of the VC activity. We think that logical positivism was based on the insight and anticipation of what mathematical logic is capable when elaborated to some depth. Logical positivism, in great part represented by VC, influenced and took part in the birth of modern mathematical logic. The members of VC were brave forerunners and pioneers.

Explore related subjects

math.LOgr-qc

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

H. Andréka, J. X. Madarász, I. Németi, P. Németi, G. Székely. 2011-01-31. Vienna Circle and Logical Analysis of Relativity Theory. https://doi.org/10.1007/978-3-7091-0177-3_11

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗