On the Computability of Region-Based Euclidean Logics

DOI10.1007/978-3-642-15205-4_34zbMath1287.03063OpenAlexW1544585409MaRDI QIDQ3586058

Ian Pratt-Hartmann, Yavor Nenov

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_34

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Complexity of proofs (03F20)

Related Items (2)

Target counting with Presburger constraints and its application in sensor networks ⋮ POINT-FREE GEOMETRY, OVALS, AND HALF-PLANES

This page was built for publication: On the Computability of Region-Based Euclidean Logics