Consistent ultrafinitist logic

DOI10.4230/LIPICS.TYPES.2023.5MaRDI QIDQ6865658zbMATH OpenFDO

Authors Michał J. Gajda

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TYPES.2023.5

zbMATH Keywords

bounded Turing completenessdecidable logicexplicit complexitylogic of computabilitystrict finitismultrafinitism

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites work

• A chronology and historical analysis of the mathematical manuscripts of Gregorius a Sancto Vincentio (1584-1667)
• A comparison of Archimedes' and Liu Hui's studies of circles
• A structural approach to operational semantics
• Accessible Independence Results for Peano Arithmetic
• Constructivism in mathematics. An introduction. Volume II
• Explicit finitism
• scientific article; zbMATH DE number 3910392 (Why is no real title available?)
• scientific article; zbMATH DE number 3711945 (Why is no real title available?)
• scientific article; zbMATH DE number 3760125 (Why is no real title available?)
• scientific article; zbMATH DE number 3774850 (Why is no real title available?)
• scientific article; zbMATH DE number 512790 (Why is no real title available?)
• scientific article; zbMATH DE number 1028819 (Why is no real title available?)
• scientific article; zbMATH DE number 819737 (Why is no real title available?)
• scientific article; zbMATH DE number 7204428 (Why is no real title available?)
• scientific article; zbMATH DE number 3217001 (Why is no real title available?)
• scientific article; zbMATH DE number 5054077 (Why is no real title available?)
• scientific article; zbMATH DE number 3286027 (Why is no real title available?)
• scientific article; zbMATH DE number 3310055 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• Implicit computation complexity in higher-order programming languages
• Incompleteness in the finite domain
• Mathematical problems. Lecture delivered before the international congress of mathematicians at Paris in 1900. Translated by \textit{Mary Winston Newson}.
• Note on an operation of the third grade.
• On feasible numbers
• On history of epsilontics
• On the restricted ordinal theorem
• Primitive recursive functions
• Programming in the λ-Calculus: From Church to Scott and Back
• Relations Between Time and Tape Complexities
• Structure in complexity theory. Proceedings of the Conference held at the University of California, Berkeley, California, June 2-5, 1986
• Sur le nombre transfini ^.
• Systems of predicative analysis
• Terminating general recursion
• The Ackermann function. a theoretical, computational, and formula manipulative study
• The paradox of inference and the non-triviality of analytic information
• Tuple Interpretations for Higher-Order Complexity.
• Wang's paradox
• Who Gave You the Epsilon? Cauchy and the Origins of Rigorous Calculus
• Zum Hilbertschen Aufbau der reellen Zahlen.
• Über das Unendliche.
• Über die Verallgemeinerung der Theorie der Rekursiven Funktionen für Abstrakte Mengen Geeigneter Struktur als Definitionsbereiche
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.

This page was built for publication: Consistent ultrafinitist logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865658)