Epsilon-logic is more expressive than first-order logic over finite structures

DOI 10.2307/2695073</link>zbMath 0994.03028</link>OpenAlex W2132519377</link>MaRDI QID Q2710605</link>

Martin Otto

Publication date: 24 April 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695073

zbMATH Keywords

databasechoicefinite structuresinvariant sentencesHilbert's \(\varepsilon\)-operator

Mathematics Subject Classification ID

Database theory (68P15) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13)

Related Items (3)

Towards a characterization of order-invariant queries over tame graphs ⋮ Semantics and Proof Theory of the Epsilon Calculus ⋮ Lower bounds for invariant queries in logics with counting.

Cites Work

• An optimal lower bound on the number of variables for graph identification
• Non-determinism in logic-based languages
• Logical hierarchies in PTIME
• Unnamed Item
• Unnamed Item

This page was built for publication: Epsilon-logic is more expressive than first-order logic over finite structures