Results 171 to 180 of about 2,771 (212)
Some of the next articles are maybe not open access.

ON TARSKI?S ASSUMPTIONS

Synthese, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Alfred Tarski

Journal of Symbolic Logic, 1986
This is a brief biography, listing also all of Tarski's Ph. D. students, and mentioning some other students and colleagues influenced by him.
openaire   +2 more sources

The Banach-Tarski paradox

Logique et Analyse, 2023
Summary: Émile Borel regards the Banach-Tarski Paradox as a reductio ad absurdum of the Axiom of Choice. Peter Forrest instead blames the assumption that physical space has a similar structure as the real numbers. This paper argues that Banach and Tarski's result is not paradoxical and that it merely illustrates a surprising feature of the continuum ...
openaire   +1 more source

Tarski and geometry

Journal of Symbolic Logic, 1986
Tarski published his first geometry paper, [24b], in 1924. As is well known, the area of the union of two disjoint figures is the sum of the areas of these two figures. This observation is the basis of a method for proving that two figures, say A and B, have the same area: if we can divide each of the two figures A and B into a finite number of ...
openaire   +1 more source

Tarski On Logical Notions

Synthese, 2003
The paper under review is an attempt to explain Tarski's conception of logical notions based on the idea of invariance. The analyses included in the paper lead the author to the conclusion that this conception did not undego any significant modifications throughout Tarski's life.
openaire   +2 more sources

Fast simplifications for Tarski formulas based on monomial inequalities

open access: yesJournal of Symbolic Computation, 2012
We define the “combinatorial part” of a Tarski formula in which equalities and inequalities are in factored or partially-factored form. The combinatorial part of a formula contains only “monomial inequalities”, which are sign conditions on monomials.
Brown, Christopher W.
exaly   +2 more sources

Knaster-Tarski Revisited

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

On Tarski’s Axiomatization of Mereology

Studia Logica, 2018
It 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

The Banach-Tarski Theorem

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

Bibliography of Alfred Tarski

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

Home - About - Disclaimer - Privacy