Invariant definability. (Extended abstract)

DOI10.1007/3-540-63385-5_43MaRDI QIDQ4364514zbMATH OpenFDO

Authors Johann A. Makowsky

Publication date 17 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63385-5_43

zbMATH Keywords

complexity classesdescriptive complexity theoryinvariant definabilitylinear order

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Invariant definability and P/poly
• Order invariance on decomposable structures
• How to define a linear order on finite models
• Computer Science Logic

Cited in

(14)

• Invertible definitions
• Jump inversions of algebraic structures and the \({\Sigma}\)-definability
• Invariance and definability, with and without equality
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Definable invariants of bilinear mappings
• Definability and invariance
• Logics of finite Hankel rank
• Abstract Interpretations in the Framework of Invariant Sets
• Invariant definability and P/poly
• scientific article; zbMATH DE number 1936755 (Why is no real title available?)
• Jump inversions of algebraic structures and Σ‐definability
• Epsilon-invariant substitutions and indefinite descriptions
• New algebraic invariants for definable subsets in universal algebra
• My writing

This page was built for publication: Invariant definability. (Extended abstract)

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