Results 1 to 10 of about 235,200 (216)
Does Set Theory Really Ground Arithmetic Truth?
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth. Our method is to emphasize the incomplete picture of both theories
Alfredo Roque Freire
doaj +3 more sources
An Interval Approach for Robust Parameterization of Controllers for Electric Drives
Uncertain models, e.g., due to component variations and measurement errors during system identification, in combination with the desire to be able to provide guarantees regarding system performances a priori, represent major challenges for users when ...
Philipp Schäfer, Stefan Krebs
doaj +1 more source
The increased share of variable renewable energy sources such as wind and solar power poses constraints on the stability of the grid and the security of supply due to the imbalance between electricity production and demand. Chemical storage or power-to-X
Ward Suijs, Sebastian Verhelst
doaj +1 more source
Vopěnkova Alternativní teorie množin v matematickém kánonu 20. století
Vopěnka’s Alternative Set Theory can be viewed both as an evolution and as a revolution: it is based on his previous experience with nonstandard universes, inspired by Skolem’s construction of a nonstandard model of arithmetic, and its inception has been
Haniková, Zuzana
doaj +1 more source
New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x ...
Fred Tyrrell
doaj +1 more source
Computable Quotient Presentations of Models of Arithmetic and Set Theory [PDF]
We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a c.e. equivalence relation.
Godziszewski, Michał Tomasz +1 more
openaire +2 more sources
On highly equivalent non-isomorphic countable models of arithmetic and set theory
It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to isomorphism of countable models is the length of back-and-forth sequences that can be established between them.
Hyttinen, Tapani, Väänänen, Jouko
openaire +2 more sources
Constructive set theory and Brouwerian principles [PDF]
The paper furnishes realizability models of constructive Zermelo-Fraenkel set theory, CZF, which also validate Brouwerian principles such as the axiom of continuous choice (CC), the fan theorem (FT), and monotone bar induction (BIM), and thereby ...
Rathjen, M
core +2 more sources
Ultrafilters maximal for finite embeddability [PDF]
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is related to the ...
Baglini, Lorenzo Luperi
core +3 more sources
In practical applications relating to business and management sciences, there are many variables that, for their own nature, are better described by a pair of ordered values (i.e. financial data).
Fabrizio Maturo
doaj +1 more source

