Keyword: Finitary Mathematics

ErSh:21
Erdos+Shelah, On problems of Moser and Hanson -- Graph theory and applications (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., 1972; dedicated to memory J. W. T. Youngs) (1972) 75--79
HLSh:60
Hodges+Lachlan+Shelah, Possible orderings of an indiscernible sequence -- Bulletin London Math Soc 9 (1977) 212-215
GPShS:134
Gabbay+Pnueli+Shelah+Stavi, On the temporal analysis of fairness -- Proc.~ seventh Annual SIG ACT --- SIG PLAN Symposium on Principles of Programming Languages, January 23- 30, 1980 (1980) 163--173
GuSh:178
Gurevich+Shelah, Random models and the Godel case of the decision problem -- J Symbolic Logic 48 (1983) 1120-1124
GGSh:184
Goldfarb+Gurevich+Shelah, A decidable subclass of the minimal Godel class with identity -- J Symbolic Logic 49 (1984) 1253-1261
LhSh:193
Lehmann+Shelah, Reasoning with time and chance -- Information and Control 53 (1982) 165-198
KfSh:201
Kaufmann+Shelah, On random models of finite power and monadic logic -- Discrete Math 54 (1985) 285-293
DGSh:213 [abstract]
Denenberg+Gurevich+Shelah, Definability by constant-depth polynomial-size circuits -- Information and Control 70 (1986) 216-240
GuSh:230
Gurevich+Shelah, The decision problem for branching time logic -- J Symbolic Logic 50 (1985) 668-681
GuSh:243
Gurevich+Shelah, Expected computation time for Hamiltonian path problem -- SIAM J on Computing 16 (1987) 486-502
GuSh:244
Gurevich+Shelah, The fix point extensions of first order logic -- Proc 26th Annual Symp. on Foundation of Computer Science (1985) 346--353
GuSh:244a
Gurevich+Shelah, Fixed-point extensions of first-order logic -- Annals Pure and Applied Logic 32 (1986) 265-280
CHSh:245
Compton+Henson+Shelah, Nonconvergence, undecidability, and intractability in asymptotic problems -- Annals Pure and Applied Logic 36 (1987) 207-224
GuSh:277
Gurevich+Shelah, Nearly linear time -- Logic at Botik '89 (Pereslavl-Zalesskiy, 1989) (1989) 108--118
DzSh:281
Drezner+Shelah, On the complexity of the Elzinga-Hearn algorithm for the $1$-center problem -- Math Operations Research 12 (1987) 255-261
ShSp:304
Shelah+Spencer, Zero-one laws for sparse random graphs -- J American Math Soc 1 (1988) 97-115
GuSh:332
Gurevich+Shelah, Non-deterministic linear time task may require substantially non linear determinate work
GuSh:332a
Gurevich+Shelah, Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space -- J Association for Computing Machinery 37 (1990) 674-687
GuSh:343
Gurevich+Shelah, Time polynomial in input or output -- J Symbolic Logic 54 (1989) 1083-1088
PeSh:354
Perles+Shelah, A closed $(n+1)$-convex set in ${\bf R}^ 2$ is a union of $n^ 6$ convex sets -- Israel J Math 70 (1990) 305-312
ShSp:382 1995-12-08 [pdf] [ps] [abstract] [arXiv:math.LO/9401211]
Shelah+Spencer, Can You Feel the Double Jump? -- Random Structures and Algorithms 5 (1994) 191-204
ShSp:432 1994-01-28 [pdf] [ps] [abstract] [arXiv:math.LO/9401214]
Shelah+Spencer, Random Sparse Unary Predicates -- Random Structures \& Algorithms 5 (1994) 375-394
LuSh:435 1995-01-25 [pdf] [ps] [abstract] [arXiv:math.LO/9501221]
Luczak+Shelah, Convergence in homogeneous random graphs -- Random Structures \& Algorithms 6 (1995) 371-391
GISh:525 1994-11-12 [pdf] [ps] [abstract] [arXiv:math.LO/9411235]
Gurevich+Immerman+Shelah, McColm Conjecture -- Symposium on Logic in Computer Science (1994) 10--19
GuSh:526 1994-11-04 [pdf] [ps] [abstract] [arXiv:math.LO/9411236]
Gurevich+Shelah, On Finite Rigid Structures -- J Symbolic Logic 61 (1996) 549-562
LeSh:527 1997-07-23 [pdf] [ps] [abstract] [arXiv:math.LO/9701219]
Lifsches+Shelah, Random Graphs in the monadic theory of order -- Archive for Math Logic 38 (1999) 273-312
BlSh:528 1996-07-11 [pdf] [ps] [abstract] [arXiv:math.LO/9607226]
Baldwin+Shelah, Randomness and Semigenericity -- Transactions American Math Soc 349 (1997) 1359-1376
BGSh:533 2000-10-27 [pdf] [ps] [abstract] [arXiv:math.LO/9705225]
Blass+Gurevich+Shelah, Choiceless Polynomial Time -- Annals Pure and Applied Logic 100 (1999) 141-187
GuSh:536 2003-04-06 [pdf] [ps] [abstract] [arXiv:math.LO/0404150]
Gurevich+Shelah, Spectra of Monadic Second-Order Formulas with One Unary Function -- Proc 18th Annual IEEE Symposium on Logic in Computer Science (2003) 291--300
BlSh:567 2003-07-15 [pdf] [ps] [abstract] [arXiv:math.LO/9607228]
Baldwin+Shelah, DOP and FCP in Generic Structures -- J Symbolic Logic 63 (1998) 427-438
RShW:611 1996-04-25 [pdf] [ps] [abstract] [arXiv:math.LO/9604244]
Rosen+Shelah+Weinstein, $k$--Universal Finite Graphs -- Logic and Random Structures: DIMACS Workshop, November 5-7, 1995 (1997) 65-77
BlSh:623 1989-01-14 [pdf] [ps] [abstract] [arXiv:math.LO/9801152]
Baldwin+Shelah, On the classifiability of cellular automata -- Theoretical Computer Science 230 (2000) 117-129
GoSh:633 1997-07-14 [pdf] [ps] [abstract] [arXiv:math.LO/9707203]
Goldstern+Shelah, Order-polynomially complete lattices must be LARGE -- Algebra Universalis 39 (1998) 197-209
KjSh:649 1998-05-08 [pdf] [ps] [abstract] [arXiv:math.CO/9805150]
Kojman+Shelah, Regressive Ramsey numbers are Ackermannian -- J Combinatorial Theory, Series A 86 (1999) 177-181
BGSh:760 2001-02-06 [pdf] [ps] [abstract] [arXiv:math.LO/0102059]
Blass+Gurevich+Shelah, On polynomial time computation over unordered structures -- J Symbolic Logic 67 (2002) 1093-1125
DoSh:865 2006-07-19 [pdf] [ps] [abstract] [arXiv:math.LO/0607375]
Doron+Shelah, Relational structures constructible by quantifier free definable operations -- J Symbolic Logic 72 (2007) 1283-1298
DoSh:953 2010-04-04 [pdf] [ps] [abstract]
Doron+Shelah, Hereditary Zero-One Laws for Graphs -- Fields Logic and Computation: Essays dedicated to Yuri Gurevich on Occasion his 70th Birthday (2010) 581--614
LrMaSh:965 2010-05-14 [pdf] [ps] [abstract]
Larson+Matteo+Shelah, Majority decisions when abstention is possible -- Discrete Math 312 (2012) 1336-1352
MiSh:978 2012-03-02 [pdf] [ps] [abstract]
Malliaris+Shelah, Regularity lemmas for stable graphs -- Transactions American Math Soc 366 (2014) 1551-1585
HbSh:986 2015-10-21_2 [pdf] [ps] [abstract] [arXiv:math.LO/1510.06574]
Haber+Shelah, Random graphs and Lindstr\"{o}m quantifiers for natural graph properties
HbSh:1059 [abstract] [arXiv:math.LO/1510.06581]
Haber+Shelah, An extension of the Ehrenfeucht-Fra{\"{\i}}sse game for \mbox{first order} logics augmented with Lindstr\"{o}m quantifiers -- Fields Logic and Computation II (Yurifest Workshop) (2015) 226--236