Can one design a geometry engine? On the (un) decidability of certain affine Euclidean geometries

JA Makowsky - Annals of Mathematics and Artificial Intelligence, 2019 - Springer
We survey the status of decidability of the first order consequences in various
axiomatizations of Hilbert-style Euclidean geometry. We draw attention to a widely …

The Undecidability of Orthogonal and Origami Geometries

JA Makowsky - Logic, Language, Information, and Computation: 25th …, 2018 - Springer
In the late 1950s A. Tarski published an abstract stating that the set of first order
consequences of projective (and also affine) incidence geometry is undecidable. Although …

Can one design a geometry engine? On the (un) decidability of affine Euclidean geometries

JA Makowsky - arXiv preprint arXiv:1712.07474, 2017 - arxiv.org
We survey the status of decidabilty of the consequence relation in various axiomatizations of
Euclidean geometry. We draw attention to a widely overlooked result by Martin Ziegler from …

23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016)

J Väänänen, R Queiroz, MO Galindo, CZ Cortés… - 2017 - academic.oup.com
254 Conferences committee, assisted by a number of external reviewers, has led to the
acceptance of 23 papers for presentation at the meeting and inclusion in the Proceedings …

[HTML][HTML] Logic Seminar

JY Beziau - imar.ro
In this talk I will explain how I have started my research in mathematical logic on
paraconsistent logics, logics which rejected the principle of non contradiction, mainly …

[引用][C] Padding of strings, small strings, and the decidability of an NP-complete problem

C Gaßner - Preprint, 2006

[引用][C] From Ëtructures with P= NP to Ëtructures with P= NP and Reverse

C Gaßner - 2006