Succinct definitions in the first order theory of graphs (Q2368907): Difference between revisions

@@ Property / author @@
-J. H. Spencer
@@ Property / author: J. H. Spencer / rank @@
-Normal rank
@@ Property / author @@
-Oleg Verbitsky
@@ Property / author: Oleg Verbitsky / rank @@
-Normal rank
@@ Property / author @@
+J. H. Spencer
@@ Property / author: J. H. Spencer / rank @@
+Normal rank
@@ Property / author @@
+Oleg Verbitsky
@@ Property / author: Oleg Verbitsky / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1966115134
@@ Property / OpenAlex ID: W1966115134 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+math/0401307
@@ Property / arXiv ID: math/0401307 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691140
@@ Property / cites work: Q5691140 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+Some theorems on definability and decidability
@@ Property / cites work: Some theorems on definability and decidability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of games to the completeness problem for formalized theories
+Normal rank
@@ Property / cites work @@
+Q5596785
@@ Property / cites work: Q5596785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3230355
@@ Property / cites work: Q3230355 / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism testing for embeddable graphs through definability
+Normal rank
@@ Property / cites work @@
+Q4046036
@@ Property / cites work: Q4046036 / rank @@
+Normal rank
@@ Property / cites work @@
+Existential interpretation. II
@@ Property / cites work: Existential interpretation. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4404920
@@ Property / cites work: Q4404920 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+How complex are random graphs in first order logic?
+Normal rank
@@ Property / cites work @@
+Q5528627
@@ Property / cites work: Q5528627 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596794
@@ Property / cites work: Q5596794 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4337021
@@ Property / cites work: Q4337021 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586197
@@ Property / cites work: Q5586197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263796
@@ Property / cites work: Q4263796 / rank @@
+Normal rank
@@ Property / cites work @@
+The first order definability of graphs: Upper bounds for quantifier depth
+Normal rank
@@ Property / cites work @@
+Descriptive complexity of finite structures: Saving the quantifier rank
+Normal rank
@@ Property / cites work @@
+Q5586299
@@ Property / cites work: Q5586299 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of Second-Order Theories and Automata on Infinite Trees
+Normal rank
@@ Property / cites work @@
+Certain logical reduction and decision problems
@@ Property / cites work: Certain logical reduction and decision problems / rank @@
+Normal rank
@@ Property / cites work @@
+The strange logic of random graphs
@@ Property / cites work: The strange logic of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility of an algorithm for the decision problem in finite classes
+Normal rank
@@ Property / cites work @@
+Sentences true in all constructive models
@@ Property / cites work: Sentences true in all constructive models / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2368907