On the computability of region-based Euclidean logics

DOI10.1007/978-3-642-15205-4_34MaRDI QIDQ3586058zbMATH OpenOpenAlexFDO

Authors Yavor Nenov, Ian Pratt-Hartmann

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

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

Recommendations

• Topological logics with connectedness over Euclidean spaces
• The Expressivity of Quantifying over Regions
• Spatial logics with connectedness predicates
• Logics in Artificial Intelligence
• Line-based affine reasoning in Euclidean plane

Cited in

(3)

• Topological logics with connectedness over Euclidean spaces
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586058)