Results 11 to 20 of about 5,613 (178)

Duality for powerset coalgebras [PDF]

open access: yesLogical Methods in Computer Science, 2022
Let CABA be the category of complete and atomic boolean algebras and complete boolean homomorphisms, and let CSL be the category of complete meet-semilattices and complete meet-homomorphisms. We show that the forgetful functor from CABA to CSL has a left
Guram Bezhanishvili   +2 more
doaj   +1 more source

Tarski's influence on computer science [PDF]

open access: yesLogical Methods in Computer Science, 2006
The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of ...
Solomon Feferman
doaj   +1 more source

Transposition Regular TA-Groupoids and Their Structures

open access: yesAxioms, 2022
Tarski associative groupoid (TA-groupoid) is a kind of non-associative groupoid satisfying Tarski associative law. In this paper, the new notions of transposition regular TA-groupoid are proposed and their properties and structural characteristics are ...
Xiaogang An, Xiaohong Zhang
doaj   +1 more source

Implications of Tarski's undefinability theorem on the Theory of Everything [PDF]

open access: yesEurophysics letters
The Theory of Everything seeks to unify all fundamental forces of nature, including quantum gravity, into a single theoretical framework. This theory would be defined internally using a set of axioms, and this paper proposes a set of axioms for any such ...
Mir Faizal, Arshid Shabir, A. Khan
semanticscholar   +1 more source

Tarski's theorem on intuitionistic logic, for polyhedra [PDF]

open access: yesAnnals of Pure and Applied Logic, 2017
In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1 suffices, as does
N. Bezhanishvili   +3 more
semanticscholar   +1 more source

On the ‘Definability of Definable’ Problem of Alfred Tarski

open access: yesMathematics, 2020
In this paper we prove that for any m≥1 there exists a generic extension of L, the constructible universe, in which it is true that the set of all constructible reals (here subsets of ω) is equal to the set D1m of all reals definable by a parameter free ...
V. Kanovei, V. Lyubetsky
semanticscholar   +1 more source

Note sur Popper lecteur de Tarski

open access: yesPhilosophia Scientiæ, 2007
1. Introduction. 2. Is Tarski’s theory of truth, as Popper claims after Tarski himself, a rehabilitation of the traditional view of truth as correspondence to facts? — Yes, but not for the reasons he gives. 3.
Philippe de Rouilhan
doaj   +1 more source

Gödel, Tarski and the Lure of Natural Language

open access: yes, 2020
Is mathematics 'entangled' with its various formalisations? Or are the central concepts of mathematics largely insensitive to formalisation, or 'formalism free'? What is the semantic point of view and how is it implemented in foundational practice?
J. Kennedy
semanticscholar   +1 more source

From Tarski to Gödel - or how to derive the second incompleteness theorem from the undefinability of truth without self-reference [PDF]

open access: yesJournal of Logic and Computation, 2018
In this paper, we provide a fairly general self-reference-free proof of the second incompleteness theorem from Tarski’s theorem on the undefinability of truth.
A. Visser
semanticscholar   +1 more source

Aristotle and Tarski

open access: yesPeitho, 2017
Alfred Tarski frequently declared that his semantic definition of truth was inspired by Aristotle’s views. The present paper discusses this issue in the context of Marian Wesoły’s criticism of the thesis that there is an affinity between Tarski’s views ...
Jan Woleński
doaj   +1 more source

Home - About - Disclaimer - Privacy