Definability in First Order Theories of Graph Orderings

被引：4

作者：

Ramanujam, R. ^{[1
]}

Thinniyam, R. S. ^{[1
]}

机构：

[1] Inst Math Sci, Madras 600113, Tamil Nadu, India

来源：

LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2016) | 2016年 / 9537卷

关键词：

Graphs; Partial order; Logical theory; Definability; SUBSTRUCTURE ORDERINGS; UNDECIDABILITY;

D O I：

10.1007/978-3-319-27683-0_23

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study definability in the first order theory of graph order: that is, the set of all simple finite graphs ordered by either the minor, subgraph or induced subgraph relation. We show that natural graph families like cycles and trees are definable, as also notions like connectivity, maximum degree etc. This naturally comes with a price: bi-interpretability with arithmetic. We discuss implications for formalizing statements of graph theory in such theories of order.

引用

页码：331 / 348

页数：18

共 50 条

[31] DECIDABILITY AND DEFINABILITY RESULTS CONCERNING WELL-ORDERINGS AND SOME EXTENSIONS OF 1ST ORDER LOGIC
CHLEBUS, BS
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1980, 26 (06): : 529 - 536
[32] ON PRODUCTS OF FIRST ORDER THEORIES
PACHOLSKI, L
BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1969, 17 (12): : 793 - +
[33] Definability a family of sets in the graph
Tussupov, J. A.
Jetpisov, K. J.
Satekbaeva, A. J.
Jalmagambetova, L. M.
BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS, 2012, 67 (03): : 84 - 89
[34] AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
Carton, Olivier
Colcombet, Thomas
Puppis, Gabriele
JOURNAL OF SYMBOLIC LOGIC, 2018, 83 (03) : 1147 - 1189
[35] The first-order theory of lexicographic path orderings is undecidable
Comon, H
Treinen, R
THEORETICAL COMPUTER SCIENCE, 1997, 176 (1-2) : 67 - 87
[36] Definability of languages by generalized first-order formulas over (n,+)
Roy, Amitabha
Straubing, Howard
SIAM JOURNAL ON COMPUTING, 2007, 37 (02) : 502 - 521
[37] First-Order Modal Logic: Frame Definability and a Lindstrom Theorem
Zoghifard, R.
Pourmahdian, M.
STUDIA LOGICA, 2018, 106 (04) : 699 - 720
[38] Definability in the Subword Order
Kudinov, Oleg V.
Selivanov, Victor L.
Yartseva, Lyudmila V.
PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 246 - +
[39] A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
Kudinov, Oleg V.
Selivanov, Victor L.
MATHEMATICAL THEORY AND COMPUTATIONAL PRACTICE, 2009, 5635 : 290 - +
[40] A list of arithmetical structures complete with respect to the first-order definability
Korec, I
THEORETICAL COMPUTER SCIENCE, 2001, 257 (1-2) : 115 - 151

← 1 2 3 4 5 →