First order logic, fixed point logic and linear order

DOI10.1007/3-540-61377-3_37zbMATH Open1540.03063MaRDI QIDQ6560167

Anuj Dawar, Steven Lindell, Scott Weinstein

Publication date: 21 June 2024

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other infinitary logic (03C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Definability with bounded number of bound variables
• When is arithmetic possible?
• Upper and lower bounds for first order expressibility
• Datalog extensions for database queries and updates
• Infinitary logics and 0-1 laws
• Elementary induction on abstract structures
• Computing with first-order logic
• Infinitary logic and inductive definability over finite structures
• The expressive power of finitely many generalized quantifiers
• On uniformity within \(NC^ 1\)
• Relational queries computable in polynomial time
• Rudimentary Predicates and Relative Computation
• Deux ou trois choses que je sais de L_n

This page was built for publication: First order logic, fixed point logic and linear order

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