Results 161 to 170 of about 590 (188)
Some of the next articles are maybe not open access.

On recursively enumerable and arithmetic models of set theory

Journal of Symbolic Logic, 1958
In this note we shall prove a certain relative recursiveness lemma concerning countable models of set theory (Lemma 5). From this lemma will follow two results about special types of such models.Kreisel [5] and Mostowski [6] have shown that certain (finitely axiomatized) systems of set theory, formulated by means of the ϵ relation and certain ...
openaire   +1 more source

Minimal elementary extensions of models of set theory and arithmetic

Archive for Mathematical Logic, 1990
We discuss minimal elementary extensions of models of set theory and contrast the behavior of models of set theory and arithmetic as regarding such extensions. Our main result, proved using a Boolean ultrapower argument, is:
openaire   +1 more source

On expandability of models of Peano arithmetic to models of the alternative set theory

Journal of Symbolic Logic, 1992
AbstractWe give a sufficient condition for a countable model M of PA to be expandable to an ω-model of AST with absolute Ω-orderings. The condition is in terms of saturation schemes or, equivalently, in terms of the ability of the model to code sequences which have some kind of definition in (M, ω). We also show that a weaker scheme of saturation leads
openaire   +2 more sources

Extended Arithmetic Reduction of Age Models for the Failure Process of a Repairable System

Reliability Engineering and System Safety, 2021
A Syamsundar, Shaomin Wu
exaly  

Using arbitrary precision arithmetic to sharpen identification analysis for DSGE models

Journal of Applied Econometrics, 2023
Zhongjun Qu, Denis Tkachenko
exaly  

Home - About - Disclaimer - Privacy