Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
61 | Alfred Tarski, Steven Givant |
Tarski's system of geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 5(2), pp. 175-214, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
60 | Christopher W. Brown 0001 |
Fast simplifications for Tarski formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 63-70, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
tarski formulas, simplification |
54 | Sergei N. Artëmov, Elena Nogina |
Topological Semantics of Justification Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 30-39, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Justification Logic, Logic of Proofs, topological semantics, Tarski, modal logic |
49 | Solomon Feferman |
Tarski's Influence on Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 342, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Maarten Marx |
XML Navigation and Tarski's Relation Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 1-2, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Yifeng Chen |
A Fixpoint Theory for Non-monotonic Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 120-134, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
41 | Jan Tarski |
Historical Background of Gödel's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Analysis of Dynamical and Cognitive Systems ![In: Analysis of Dynamical and Cognitive Systems, Advanced Course, Stockholm, Sweden, August 9-14, 1993, Proceedings, pp. 3-7, 1993, Springer, 3-540-58843-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
41 | Leon Henkin, J. Donald Monk, Alfred Tarski |
Representable cylindric algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 31, pp. 23-60, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
41 | Alfred Tarski |
An interpolation theorem for irredundant bases of closure structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 12(2), pp. 185-192, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
41 | Alfred Tarski |
A Problem Concerning the Notion of Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 13(2), pp. 107-111, 1948. The full citation details ...](Pics/full.jpeg) |
1948 |
DBLP DOI BibTeX RDF |
|
41 | J. C. C. McKinsey, Alfred Tarski |
Some Theorems About the Sentential Calculi of Lewis and Heyting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 13(1), pp. 1-15, 1948. The full citation details ...](Pics/full.jpeg) |
1948 |
DBLP DOI BibTeX RDF |
|
41 | Alfred Tarski |
On the Calculus of Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 6(3), pp. 73-89, 1941. The full citation details ...](Pics/full.jpeg) |
1941 |
DBLP DOI BibTeX RDF |
|
41 | Alfred Tarski |
On Undecidable Statements in Enlarged Systems of Logic and the Concept of Truth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 4(3), pp. 105-112, 1939. The full citation details ...](Pics/full.jpeg) |
1939 |
DBLP DOI BibTeX RDF |
|
40 | Xi Chen 0001, Yuhao Li 0002, Mihalis Yannakakis |
Reducing Tarski to Unique Tarski (in the Black-box Model). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
40 | Xi Chen 0001, Yuhao Li 0002, Mihalis Yannakakis |
Reducing Tarski to Unique Tarski (In the Black-Box Model). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 21:1-21:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
40 | Zoltán Kovács, Christopher W. Brown 0001, Tomás Recio, Róbert Vajda |
A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2022, Hagenberg / Linz, Austria, September 12-15, 2022, pp. 59-62, 2022, IEEE, 978-1-6654-6545-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
40 | Xiaohong Zhang 0001, Wangtao Yuan, Mingming Chen, Florentin Smarandache |
A Kind of Variation Symmetry: Tarski Associative Groupoids (TA-Groupoids) and Tarski Associative Neutrosophic Extended Triplet Groupoids (TA-NET-Groupoids). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 12(5), pp. 714, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
40 | Young Bae Jun, Min Su Kang |
Fuzzifications of generalized Tarski filters in Tarski algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 61(1), pp. 1-7, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
40 | G. Y. Sher |
Did Tarski Commit "Tarski's Fallacy"? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 61(2), pp. 653-686, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
40 | Keiko Imai, Akitoshi Kawamura, Jirí Matousek 0001, Daniel Reem, Takeshi Tokuyama |
Distance k-sectors exist. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 210-215, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
distance k-sectors, knaster-tarski fixed point theorem |
40 | Yves Bertot, Vladimir Komendantsky |
Fixed point semantics and partial recursion in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain, pp. 89-96, 2008, ACM, 978-1-60558-117-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
least fixed point semantics, non-terminating functions, program extraction, the Knaster-Tarski theorem, automated theorem proving |
40 | Andrzej Grzegorczyk |
Undecidability without Arithmetization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 79(2), pp. 163-230, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
discernibility, Kurt Gödel, Alfred Tarski, representability, decidability, arithmetization, concatenation |
40 | Grzegorz Malinowski |
Inferential Intensionality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 76(1), pp. 3-16, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
consequence, C-equivalence, C-equality, rule of inference, Tarski, ukasiewicz, modal system, modal logic, inference, proof, acceptance, rejection, four-valued logic, four-valued logic |
34 | András Bezdek |
On a Generalization of Tarski's Plank Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(2), pp. 189-200, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Julien Narboux |
Mechanical Theorem Proving in Tarski's Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automated Deduction in Geometry ![In: Automated Deduction in Geometry, 6th International Workshop, ADG 2006, Pontevedra, Spain, August 31-September 2, 2006. Revised Papers, pp. 139-156, 2006, Springer, 978-3-540-77355-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Alasdair Urquhart |
Duality Theory for Projective Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational Methods in Computer Science, 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers, pp. 33-47, 2005, Springer, 3-540-33339-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Pasquale Caianiello, Stefania Costantini, Eugenio G. Omodeo |
An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them: I: Language Extension Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory and Applications of Relational Structures as Knowledge Instruments ![In: Theory and Applications of Relational Structures as Knowledge Instruments, COST Action 274, TARSKI, Revised Papers, pp. 87-106, 2003, Springer, 3-540-20780-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Calculus of relations, logic programming, relation algebras, algebraic specifications, computational logic |
34 | Jan Van den Bussche |
Applications of Alfred Tarski's Ideas in Database Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 20-37, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Ivo Düntsch, Marc Roubens |
Tangent Circle Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational Methods in Computer Science, 6th International Conference, RelMICS 2001, and 1st Workshop of COST Action 274 TARSKI Oisterwijk, The Netherlands, October 16-21, 2001, Revised Papers, pp. 300-313, 2001, Springer, 3-540-00315-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Jan E. Jonker |
Knaster-Tarski Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 10(3), pp. 214-232, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Complete partial order, Generalization, Fixpoint |
29 | Nuel Belnap |
Truth Values, Neither-true-nor-false, and Supervaluations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 91(3), pp. 305-334, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
neither-true-nor-false, non-denoting terms, future tense, vagueness, paradoxes, truth values |
29 | Marcin Wolski |
Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets X, pp. 1-14, 2009, Springer, 978-3-642-03280-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Gianpiero Cattaneo, Davide Ciucci |
Lattices with Interior and Closure Operators and Abstract Approximation Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets X, pp. 67-116, 2009, Springer, 978-3-642-03280-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Yoshihiro Maruyama |
A Duality for Algebras of Lattice-Valued Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 281-295, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Richard C. Holt |
WCRE 1998 Most Influential Paper: Grokking Software Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCRE ![In: WCRE 2008, Proceedings of the 15th Working Conference on Reverse Engineering, Antwerp, Belgium, October 15-18, 2008, pp. 5-14, 2008, IEEE Computer Society, 978-0-7695-3429-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
Model Theory Makes Formulas Large. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 913-924, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Roberto Di Cosmo, Thomas Dufour |
The Equational Theory of < N, 0, 1, +, ×, uparrow > Is Decidable, but Not Finitely Axiomatisable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, pp. 240-256, 2004, Springer, 3-540-25236-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Tomás Feder, Moshe Y. Vardi |
Homomorphism Closed vs. Existential Positive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 311-320, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Savvas Pericleous, Nicolai N. Vorobjov Jr. |
New complexity bounds for cylindrical decompositions of sub-pfaffian sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 268-275, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Ingbert Kupka |
Unique Fixpoints in Complete Lattices with Applications to Formal Languages and Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Foundations of Computer Science: Potential - Theory - Cognition ![In: Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, pp. 107-115, 1997, Springer, 3-540-63746-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Dima Grigoriev |
How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, August 20-24, 1990, pp. 104-105, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
25 | Akitoshi Kawamura, Jirí Matousek 0001, Takeshi Tokuyama |
Zone diagrams in Euclidean spaces and in other normed spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 216-221, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
knaster-tarski fixed point theorem, zone diagrams |
25 | Josep Maria Font, Ramon Jansana, Don Pigozzi |
On the Closure Properties of the Class of Full G-models of a Deductive System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 83(1-3), pp. 215-278, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Leibniz congruence, Tarski congruence, generalized matrix, full generalized model, fully adequate Gentzen system, algebraizable logic, abstract algebraic logic, protoalgebraic logic |
25 | George Voutsadakis |
Categorical Abstract Algebraic Logic: (J, N)-Algebraic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 13(3), pp. 265-280, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
equivalent deductive systems, algebraizable deductive systems, equivalent institutions, algebraizable institutions, Leibniz congruence, Tarski congruence, algebraizable sentential logics, algebras, institutions, adjunctions, abstract algebraic logic, deductive systems |
25 | Saugata Basu, Richard Pollack, Marie-Françoise Roy |
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(6), pp. 1002-1045, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Tarski-Seidenberg principle, quantifier elimination, real closed fields |
20 | David Hitchcock |
Tarski's Theory of the Formal Correctness of Definitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Philos. Log. ![In: J. Philos. Log. 53(1), pp. 181-221, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Pierre Boutry, Stéphane Kastenbaum, Clément Saintier |
Towards an Independent Version of Tarski's System of Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.11904, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Sergio A. Celani |
Relational representation for subordination Tarski algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 34(1), pp. 75-96, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Zoltán Kovács, Christopher W. Brown 0001, Tomás Recio, Róbert Vajda |
Computing with Tarski formulas and semi-algebraic sets in a web browser. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 120, pp. 102235, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Raffael Stenzel |
On notions of compactness, object classifiers, and weak Tarski universes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 33(8), pp. 661-678, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Yann Braouezec, Keyvan Kiani |
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(1), pp. 105-110, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Julian Müller |
Enumerating Tarski fixed points on lattices of binary relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.07923, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Bart Bogaerts 0001, Balder ten Cate, Brett McLean, Jan Van den Bussche |
Preservation theorems for Tarski's relation algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.04656, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Joshua Maher |
Banach-Tarski Embeddings and Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.09387, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Matteo Tesi, Sara Negri |
The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(8), pp. 103285, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Garibaldi Sarmento |
A note on Tarski's remarks about the non-admissibility of a general theory of semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 9(1), pp. 573-582, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | John Fearnley, Dömötör Pálvölgyi, Rahul Savani |
A Faster Algorithm for Finding Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 18(3), pp. 23:1-23:23, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Yoshihito Tanaka |
An extension of Jónsson-Tarski representation and model existence in predicate non-normal modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 68(2), pp. 189-201, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Xi Chen 0001, Yuhao Li 0002 |
Improved Upper Bounds for Finding Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.05913, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Saeed Salehi |
A Reunion of Godel, Tarski, Carnap, and Rosser. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.04502, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Farhad Naderian |
Non-Transferability in Communication Channels and Tarski's Truth Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.08405, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Zhen Zhao |
An Update of Tarski: Two Usages of the Word "True". ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 31(3), pp. 505-523, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jelle Hellings, Yuqing Wu, Marc Gyssens, Dirk Van Gucht |
The power of Tarski's relation algebra on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 126, pp. 100748, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Nils Kürbis |
Normalisation and subformula property for a system of classical logic with Tarski's rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 61(1-2), pp. 105-129, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Saeed Salehi |
Tarski's Undefinability Theorem and the Diagonal Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 30(3), pp. 489-498, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Xi Chen 0001, Yuhao Li 0002 |
Improved Upper Bounds for Finding Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11 - 15, 2022, pp. 1108-1118, 2022, ACM, 978-1-4503-9150-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jagadish Bapanapally, Ruben Gamboa |
A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(R). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: 13th International Conference on Interactive Theorem Proving, ITP 2022, August 7-10, 2022, Haifa, Israel., pp. 5:1-5:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-252-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jagadish Bapanapally, Ruben Gamboa |
A Formal Proof of the Banach-Tarski Theorem in ACL2(r). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), Fort Lauderdale, Florida, USA, January 3-5, 2022, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Guram Bezhanishvili, Nick Bezhanishvili, Joel Lucero-Bryan, Jan van Mill |
The McKinsey-Tarski Theorem for Locally Compact Ordered Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 27(2), pp. 187-211, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Jim de Groot, Tadeusz Litak, Dirk Pattinson |
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.01873, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Christopher W. Brown 0001, Zoltán Kovács, Róbert Vajda |
Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADG ![In: Proceedings of the 13th International Conference on Automated Deduction in Geometry, ADG 2021, Hagenberg, Austria/virtual, September 15-17, 2021., pp. 156-166, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Nils Kürbis |
Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.03939, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Roland Coghetto |
Tarski's Parallel Postulate implies the 5th Postulate of Euclid, the Postulate of Playfair and the original Parallel Postulate of Euclid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2021, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Roberto Ghiselli Ricci |
A note on a Tarski type fixed-point theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Game Theory ![In: Int. J. Game Theory 50(3), pp. 751-758, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Jim de Groot, Tadeusz Litak, Dirk Pattinson |
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-15, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Yijia Chen, Jörg Flum |
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-13, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | John Fearnley, Rahul Savani |
A Faster Algorithm for Finding Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 29:1-29:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Chuangyin Dang, Yinyu Ye 0001 |
Erratum/Correction to "On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering" [Theor. Comput. Sci. 732 (2018) 26-45]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 817, pp. 80, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Yijia Chen, Jörg Flum |
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.00420, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Sabah Al-Fedaghi |
Towards Conceptual Modeling Semantics: Eventizing Tarski's Truth Schema. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.01608, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Chuangyin Dang, Qi Qi 0003, Yinyu Ye 0001 |
Computations and Complexities of Tarski's Fixed Points and Supermodular Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.09836, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | John Fearnley, Rahul Savani |
A faster algorithm for finding Tarski fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.02618, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Frantisek Vcelar, Zuzana Pátíková |
A comparative study of Tarski's fixed point theorems with the stress on commutative sets of L-fuzzy isotone maps with respect to transitivities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 382, pp. 29-56, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis |
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA., pp. 18:1-18:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-134-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Roland Coghetto, Adam Grabowski |
Tarski Geometry Axioms. Part IV - Right Angle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formaliz. Math. ![In: Formaliz. Math. 27(1), pp. 75-85, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Neil Tennant |
On Tarski's Axiomatization of Mereology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 107(6), pp. 1089-1102, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, Mihalis Yannakakis |
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.03210, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Sergio A. Celani |
Subordination Tarski algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 29(3), pp. 288-306, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Massimo Marinacci, Luigi Montrucchio |
Unique Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 44(4), pp. 1174-1191, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Albert Visser |
From Tarski to Gödel - or how to derive the second incompleteness theorem from the undefinability of truth without self-reference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 29(5), pp. 595-604, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Sergio A. Celani |
Complete and atomic Tarski algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 58(7-8), pp. 899-914, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Alexandru Baltag, Nick Bezhanishvili, Saúl Fernández González |
The McKinsey-Tarski Theorem for Topological Evidence Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings, pp. 177-194, 2019, Springer, 978-3-662-59532-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Abhisekh Sankaran |
Revisiting the Generalized Łoś-Tarski Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLA ![In: Logic and Its Applications - 8th Indian Conference, ICLA 2019, Delhi, India, March 1-5, 2019, Proceedings, pp. 76-88, 2019, Springer, 978-3-662-58770-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Chad E. Brown, Cezary Kaliszyk, Karol Pak |
Higher-Order Tarski Grothendieck as a Foundation for Formal Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: 10th International Conference on Interactive Theorem Proving, ITP 2019, September 9-12, 2019, Portland, OR, USA., pp. 9:1-9:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-122-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Chuangyin Dang, Yinyu Ye 0001 |
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 732, pp. 26-45, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Bruce E. Litow |
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 708, pp. 91-95, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Guram Bezhanishvili, Nick Bezhanishvili, Joel Lucero-Bryan, Jan van Mill |
A New Proof of the McKinsey-Tarski Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 106(6), pp. 1291-1311, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Abhisekh Sankaran |
Revisiting the generalized Łoś-Tarski theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.06459, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Abhisekh Sankaran |
A Generalization of the Łoś-Tarski Preservation Theorem - Dissertation Summary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.01014, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
20 | Nick Bezhanishvili, Vincenzo Marra, Daniel McNeill, Andrea Pedrini |
Tarski's theorem on intuitionistic logic, for polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 169(5), pp. ii, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|