Are There Ontological Commitments in Tarski's Undefinability Argument?

Famous diagonal results are strictly syntactic or formal, yet philosophers draw ontological conclusions from them. This talk examines the ontological commitments of Tarski’s undefinability argument by applying a broader research project on the limits and ontology of calculation. Under an extended definition uniting logical calculi, Turing computability, arithmetic, and ZFC within a "Box of Calculation", I assume a minimal non-formalism and distinguish three interacting levels of ontological relevance: (1) Quinean meta-theoretic commitments, (2) explanatory labeled distinctions, then illuminated via structures and quantified over in supplementary constructions, and (3) global ontologies of mathematics in reflective equilibrium. I argue that Syntactic Tarski carries only minimal combinatorial commitments, whereas Semantic Tarski requires completed structures and external truth-sets. Even the syntactic version is ontologically fertile, carving a fissure between formal expressibility and truth which motivates metalanguage hierarchies and axiomatic truth theories. Ultimately, whether Tarskian undefinability points toward eternal truth next to Cantor’s paradise, to bounded finitude, or other realms depends on one’s ontology of mathematics.

Authors

Publication Details

Journal
Figshare
Published
2026-11-21
DOI
https://doi.org/10.6084/m9.figshare.35082871
Primary Topic
History and Theory of Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Are There Ontological Commitments in Tarski's Undefinability Argument?

MARIAN CĂLBOREAN
Figshare
History and Theory of Mathematics
article

Are There Ontological Commitments in Tarski's Undefinability Argument?

MARIAN CĂLBOREAN
article en

Abstract

Famous diagonal results are strictly syntactic or formal, yet philosophers draw ontological conclusions from them. This talk examines the ontological commitments of Tarski’s undefinability argument by applying a broader research project on the limits and ontology of calculation. Under an extended definition uniting logical calculi, Turing computability, arithmetic, and ZFC within a "Box of Calculation", I assume a minimal non-formalism and distinguish three interacting levels of ontological relevance: (1) Quinean meta-theoretic commitments, (2) explanatory labeled distinctions, then illuminated via structures and quantified over in supplementary constructions, and (3) global ontologies of mathematics in reflective equilibrium. I argue that Syntactic Tarski carries only minimal combinatorial commitments, whereas Semantic Tarski requires completed structures and external truth-sets. Even the syntactic version is ontologically fertile, carving a fissure between formal expressibility and truth which motivates metalanguage hierarchies and axiomatic truth theories. Ultimately, whether Tarskian undefinability points toward eternal truth next to Cantor’s paradise, to bounded finitude, or other realms depends on one’s ontology of mathematics.

Figshare
History and Theory of Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Are There Ontological Commitments in Tarski's Undefinability Argument? — MARIAN CĂLBOREAN · Figshare (2026) | TGRS Research Map | TGRS