Results 1 to 10 of about 28,310 (224)

Unique Tarski Fixed Points [PDF]

open access: yesMathematics of Operations Research, 2019
We establish sufficient conditions that ensure the uniqueness of Tarski-type fi xed points of monotone operators. Several applications are presented.
M. Marinacci, L. Montrucchio
semanticscholar   +3 more sources

Cefiderocol in the Successful Treatment of Complicated Hospital-Acquired K. pneumoniae NDM, OXA48 Intraabdominal Infection [PDF]

open access: yesInfection and Drug Resistance
Ignacy Tarski,1 Jakub Śmiechowicz,2 Wiesława Duszyńska2 1Faculty of Medicine, Wroclaw Medical University, Wroclaw, Poland; 2Department and Clinic of Anesthesiology and Intensive Therapy, Wroclaw Medical University, Wroclaw ...
Tarski I, Śmiechowicz J, Duszyńska W
doaj   +2 more sources

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   +3 more sources

Evaluating Etchemendy's Critiques of Tarski’s Analysis of Logical Consequence [PDF]

open access: yesJournal of Philosophical Investigations, 2022
According to Tarski's model-theoretic analysis of logical consequence, the sentence X is a logical consequence of a set of sentences Γ if and only if any model for Γ is also a model for X.
Hamid Alaeinejad, Morteza Hajhosseini
doaj   +1 more source

McKinsey-Tarski Algebras: An alternative pointfree approach to topology [PDF]

open access: yesTopology and its Applications, 2023
McKinsey and Tarski initiated the study of interior algebras. We propose complete interior algebras as an alternative pointfree approach to topology. We term these algebras McKinsey-Tarski algebras or simply MT-algebras.
G. Bezhanishvili, R. Raviprakash
semanticscholar   +1 more source

Improved Upper Bounds for Finding Tarski Fixed Points [PDF]

open access: yesACM Conference on Economics and Computation, 2022
We study the query complexity of finding a Tarski fixed point over the k-dimensional grid {1,...,n}k. Improving on the previous best upper bound of O(log⌈2k/3⌉n)[7], we give a new algorithm with query complexity O(log⌈(k+1)/2⌉n). This is based on a novel
X. Chen, Yuhao Li
semanticscholar   +1 more source

Cellular sheaves of lattices and the Tarski Laplacian [PDF]

open access: yesHomology, Homotopy and Applications, 2020
This paper initiates a discrete Hodge theory for cellular sheaves taking values in a category of lattices and Galois connections. The key development is the Tarski Laplacian, an endomorphism on the cochain complex whose fixed points yield a cohomology ...
R. Ghrist, Hans Riess
semanticscholar   +1 more source

A Faster Algorithm for Finding Tarski Fixed Points [PDF]

open access: yesSymposium on Theoretical Aspects of Computer Science, 2020
Dang et al. have given an algorithm that can find a Tarski fixed point in a k-dimensional lattice of width n using O(log k n) queries [2]. Multiple authors have conjectured that this algorithm is optimal [2, 7], and indeed this has been proven for two ...
John Fearnley, Rahul Savani
semanticscholar   +1 more source

Research on a Class of Special Quasi TA-Neutrosophic Extended Triplet: TA-Groups [PDF]

open access: yesNeutrosophic Sets and Systems, 2023
Tarski associative groupoid (TA-groupoid) and Tarski associative neutrosophic extended triplet groupoid (TA-NET-groupoid) are two interesting structures in non-associative algebra. In this paper, a new concept of TA-group is proposed based on TA-groupoid,
Mingming Chen, Yudan Du, Xiaogang An
doaj   +1 more source

Could Tajtelbaum Question What Tarski Could Not? [PDF]

open access: yesOrganon F, 2020
The paper discusses Tarski’s approach to quotation. It starts from showing that it is vulnerable to semantic inconsistencies connected with what is known as Reach’s puzzle, formulated in 1938 by a Czech logician Karel Reach.
Jan Wiślicki
doaj   +1 more source

Home - About - Disclaimer - Privacy