Results 11 to 20 of about 235,200 (216)
Undefinable classes and definable elements in models of set theory and arithmetic [PDF]
Proceedings of the American Mathematical Society, 1988 Every countable model M {\mathbf {M}} of PA or ZFC, by a theorem of S. Simpson, has a "class" X X which has the curious property: Every element of the expanded structure ( M , X ) ({\mathbf {M}},X) is
openaire +1 more source
A Stochastic Computational Approach for the Analysis of Fuzzy Systems
IEEE Access, 2017 Fault tree analysis (FTA) has been widely utilized as a reliability evaluation technique for complex systems, such as nuclear power plants and aerospace systems. However, it is hard to obtain the crisp failure probabilities of basic events, owning to the
Xiaogang Song +3 more
doaj +1 more source
On expandability of models of arithmetic and set theory to models of weak second-order theories [PDF]
Fundamenta Mathematicae, 1984 Answering two questions of Bell, Marek and Srebrny the author shows that for any consistent extension T of \(\Sigma^ 1_ 1\)-PA there is no class \(\Phi\) of \(L_{\infty \omega}\) sentences such that for all \({\mathfrak M}\vDash PA\), \({\mathfrak M}\) is expandable to a model of T iff \({\mathfrak M}\vDash \phi\), and the same if we replace PA by ZF ...
openaire +1 more source
Existentially Closed Models in the Framework of Arithmetic [PDF]
, 2016 We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. This definition is optimal with respect to quantifier complexity and allows us to improve some previously known results on ...
Adamowicz, Zofia +2 more
core +1 more source
Quantum recurrences and the arithmetic of Floquet dynamics [PDF]
QuantumThe Poincaré recurrence theorem shows that conservative systems in a bounded region of phase space eventually return arbitrarily close to their initial state after a finite amount of time.
Amit Anand +3 more
doaj +1 more source
Tecnura, 2014 In the biological environment, there has been created epidemiological models that attempt to explain the spread dynamics of an epidemic in a population to predict the behavior of possible epidemics that can affect humanity.
Pedro Guevara López +3 more
doaj +1 more source
Counter Simulations via Higher Order Quantifier Elimination: a preliminary report [PDF]
, 2017 Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations.
Ghilardi, Silvio, Pagani, Elena
core +2 more sources
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
SSRN Electronic Journal, 2020 A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest ...
openaire +4 more sources
Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics
Discrete Analysis, 2018 Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics, Discrete Analysis 2018:20, 63 pp. Szemerédi's theorem states that for every positive integer $\ell$ and every $\mu>0$ there exists $N$ such that every subset of ...
Jan Hązła +2 more
doaj +1 more source
Scott's problem for proper Scott sets [PDF]
, 2008 I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial ...
Gitman, Victoria
core +1 more source