Results 141 to 150 of about 1,570 (181)
Some of the next articles are maybe not open access.

[Unsent letter to Alfred Tarski]( *1910c)

1995
Abstract Many thanks for returning my paper and for your letter of May 19. I am sorry my answer comes so late. But I wanted first to think matters over thoroughly. Unfortunately my paper, as it stands, is no good. I wrote it in a hurry shortly after I had been ill, had been sleeping very poorly and had been taking drugs impairing the ...
Solomon Feferman (Editor-in-Chief)   +4 more
openaire   +1 more source

Alfred Tarski: Lower Bounds on Theories

2013
Logical theories have their own complexity measures, for the problems of deciding whether a statement is true or finding a proof of a theorem. Tarski proved that the first-order theory of the real numbers is decidable, but left open its complexity. This chapter surveys exponential lower bounds proved subsequently for it.
Richard J. Lipton, Kenneth W. Regan
openaire   +1 more source

On the calculus of relations

Journal of Symbolic Logic (JSL), 1941
Alfred Tarski
semanticscholar   +1 more source

Tarski, Alfred (1901–83)

2018
Alfred Tarski was a Polish mathematician and logician. He worked in metamathematics and semantics, set theory, algebra and the foundations of geometry. Some of his logical works, in particular his definition of truth, were also significant contributions to philosophy.
openaire   +1 more source

American Postulate Theorists and Alfred Tarski

History and Philosophy of Logic, 2003
This article outlines the work of a group of US mathematicians called the American Postulate Theorists and their influence on Tarski's work in the 1930s that was to be foundational for model theory. The American Postulate Theorists were influenced by the European foundational work of the period around 1900, such as that of Peano and Hilbert.
openaire   +1 more source

Alfred Tarski's elimination theory for real closed fields

The Journal of Symbolic Logic, 1988
Tarski made a fundamental contribution to our understanding of R, perhaps mathematics’ most basic structure. His theorem is the following.To any formula ϕ(X1, …, Xm) in the vocabulary {0, 1, +, ·, <} one can effectively associate two objects: (i) a quantifier free formula (X1, …, Xm) in(1) the same vocabulary, and (ii) a proofof the equivalence ϕ ↔
openaire   +1 more source

Cylindric Set Algebras

, 1981
L. Henkin   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy