Counting systems and the first Hilbert problem

DOI10.1016/J.NA.2009.09.009zbMATH Open1191.03038arXiv1203.4141OpenAlexW2158928062MaRDI QIDQ2653996FDOQ2653996

Yaroslav D. Sergeyev

Publication date: 15 January 2010

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Abstract: The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one to express different infinite numbers and to use these numbers for measuring infinite sets. Several counting systems are taken into consideration. It is emphasized in the paper that different mathematical languages can describe mathematical objects (in particular, sets and the number of their elements) with different accuracies. The traditional and the new approaches are compared and discussed.

Full work available at URL: https://arxiv.org/abs/1203.4141

zbMATH Keywords

numeral systemsinfinite numbersHilbert's first problem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Pirah%EF%BF%BD%EF%BF%BD+counting+system&go=Go Pirah�� counting system]relativity of mathematical languages

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Continuum hypothesis and Martin's axiom (03E50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistency of the Continuum Hypothesis. (AM-3)
• A new applied approach for executing computations with infinite and infinitesimal quantities
• Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
• The continuum hypothesis. I
• The continuum hypothesis. II.

Cited In (22)

• Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
• Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
• Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
• The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• Infinite computations and the generic finite
• The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system
• Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
• Iterative grossone-based computation of negative curvature directions in large-scale optimization
• Some paradoxes of infinity revisited
• A New Computational Methodology Using Infinite and Infinitesimal Numbers
• A pennorth of grossone
• The Olympic medals ranks, lexicographic ordering, and numerical infinities
• The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
• On accuracy of mathematical languages used to deal with the Riemann zeta function and the Dirichlet eta function
• Using grossone to count the number of elements of infinite sets and the connection with bijections
• A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
• Lower and upper estimates of the quantity of algebraic numbers
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
• Computations with Grossone-Based Infinities
• Infinigons of the hyperbolic plane and grossone
• Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems

This page was built for publication: Counting systems and the first Hilbert problem

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