Computing with first-order logic
From MaRDI portal
Publication:1892224
DOI10.1006/jcss.1995.1025zbMath0827.68036OpenAlexW1984930242WikidataQ56610324 ScholiaQ56610324MaRDI QIDQ1892224
Publication date: 17 December 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/407090b8f18ca3af6b73e74c2b9e616aa0af7b91
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Highly expressive query languages for unordered data trees ⋮ On the decidability of the termination problem of active database systems ⋮ On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry ⋮ How to define a linear order on finite models ⋮ Super/rosy \(L^k\)-theories and classes of finite structures ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ The Descriptive Complexity of Parity Games ⋮ Computing on structures ⋮ Computing with infinitary logic ⋮ Computable Queries for Object Oriented Databases ⋮ Reflective relational machines ⋮ A restricted second order logic for finite structures ⋮ Semantics and expressiveness issues in active databases ⋮ The Relational Polynomial-Time Hierarchy and Second-Order Logic ⋮ Querying spatial databases via topological invariants ⋮ Temporal connectives versus explicit timestamps to query temporal databases ⋮ Adding for-loops to first-order logic
This page was built for publication: Computing with first-order logic
