Results 141 to 150 of about 401 (180)
Some of the next articles are maybe not open access.
Formal Aspects of Computing, 1998
Abstract. The concept “complete partial order” is generalized to the concept “functionally complete partial order.” The correctness of a corresponding generalization of the Knaster-Tarski fixpoint theorem is proved. The theory is applied to yield a fixpoint mapping theorem.
openaire +1 more source
Abstract. The concept “complete partial order” is generalized to the concept “functionally complete partial order.” The correctness of a corresponding generalization of the Knaster-Tarski fixpoint theorem is proved. The theory is applied to yield a fixpoint mapping theorem.
openaire +1 more source
Journal of Applied Non-Classical Logics, 2019
Fil: Celani, Sergio Arturo. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Nucleo Consolidado de Matematica Pura y Aplicada; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas.
openaire +2 more sources
Fil: Celani, Sergio Arturo. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Nucleo Consolidado de Matematica Pura y Aplicada; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas.
openaire +2 more sources
On Tarski’s Axiomatization of Mereology
Studia Logica, 2018It is shown how Tarski’s 1929 axiomatization of mereology secures the reflexivity of the ‘part of’ relation. This is done with a fusion-abstraction principle that is constructively weaker than that of Tarski; and by means of constructive and relevant reasoning throughout. We place a premium on complete formal rigor of proof.
openaire +1 more source
Solution of a problem of Tarski
Journal of Symbolic Logic, 1956We presuppose the terminology of [1], and we give a negative answer to the following problem ([1], p. 19): Does every essentially undecidable axiomatizable theory have an essentially undecidable finitely axiomatizable subtheory?We use the following theorem of Kleene ([2], p. 311).
openaire +1 more source
The Mathematical Intelligencer, 1988
An informal presentation of the proof of the Banach-Tarski Theorem is given. This theorem states that there exists a (paradoxical) decomposition of the unit ball into a finite number of subsets such that the subsets can be transposed and oriented in such a way to form two identical copies of the ball.
openaire +1 more source
An informal presentation of the proof of the Banach-Tarski Theorem is given. This theorem states that there exists a (paradoxical) decomposition of the unit ball into a finite number of subsets such that the subsets can be transposed and oriented in such a way to form two identical copies of the ball.
openaire +1 more source
Journal of Symbolic Logic, 1986
The author has set forth a complete bibliography of Tarski's published works. The over 250 items are arranged in chronological order and are divided according nine sections: papers, abstracts, monographs, contributions to discussions, reviews, publications as an editor, project reports and letters.
openaire +1 more source
The author has set forth a complete bibliography of Tarski's published works. The over 250 items are arranged in chronological order and are divided according nine sections: papers, abstracts, monographs, contributions to discussions, reviews, publications as an editor, project reports and letters.
openaire +1 more source
Synthese, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Proceedings of the 1956 11th ACM national meeting on - ACM '56, 1956
The Tarski decision procedure can be briefly described as an algorithm for deciding on the validity of any elementary statement about polynomials over the field of real numbers. The adjective “elementary%rdquo; is used here in a technical sense, but its meaning will be indicated by examples.
openaire +1 more source
The Tarski decision procedure can be briefly described as an algorithm for deciding on the validity of any elementary statement about polynomials over the field of real numbers. The adjective “elementary%rdquo; is used here in a technical sense, but its meaning will be indicated by examples.
openaire +1 more source
Ray on Tarski on Logical Consequence
Journal of Philosophical Logic, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A new defense of Tarski's solution to the liar paradox
Philosophical Studies, 2022Gila Sher, Sher Gila
exaly