Filters








84 Hits in 6.7 sec

Page 2970 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
Glass (Cambridge) 99e:03026 03C75 03C13 03C65 Lynch, James F. (1-CKSN-CS; Potsdam, NY) Infinitary logics and very sparse random graphs. (English summary) J. Symbolic Logic 62 (1997), no. 2, 609-623.  ...  .,, the probability that a holds for the random graph on n vertices converges.  ... 

Page 4015 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
The result has also been proved for first-order logic under probability distributions other than the uniform one, in particular for sparse random graphs [S. Shelah and J. H. Spencer, J. Amer. Math.  ...  It has been proved for more expressive logics, such as the fixed-point logics and the infinitary logic Y>5.— which extends first-order logic with infinitary conjunctions and disjunctions while allowing  ... 

Page 7536 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
., with trivial automorphism group) structures in various logics (such as least fixed point logic LFP, partial fixed point logic PFP, infinitary logic Y@., with a finite number of variables, and the closures  ...  The third offers an analysis of rigidity (giving equivalent conditions for bounded rigidity, and treating infinitary logic with counting quan- tifiers).  ... 

JSL volume 62 issue 2 Cover and Front matter

1997 Journal of Symbolic Logic (JSL)  
VARDI 608 Infinitary logics and very sparse random graphs, by JAMES F.  ...  The JOURNAL and the BULLETIN are the official organs of the Association for Symbolic Logic, an international organization for furthering research in symbolic logic and exchange of ideas among mathematicians  ... 
doi:10.1017/s0022481200016236 fatcat:7s6n5wdax5fgdb2bc7loh37b5i

Page 2257 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
Lynch, Infinitary logics and very sparse random graphs (191-198); Guy Fayolle, Stéphane Grumbach and Christophe Tollu, Asymptotic probabilities of languages with generalized quantifiers (199-207); Moreno  ...  Reddy, A typed founda- tion for directional logic programming (282-318); Keehang Kwon, Gopalan Nadathur and Debra Sue Wilson, Implementing a notion of modules in the logic programming language AProlog  ... 

Page 4448 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
sparse unary predicates.  ...  In this article the extended branching time logic EBTL is intro- duced and shown to be decidable. The intended models of EBTL are rooted, infinite, directed acyclic graphs.  ... 

Randomisation and Derandomisation in Descriptive Complexity Theory

Kord Eickmeyer, Martin Grohe, Anuj Dawar
2011 Logical Methods in Computer Science  
Our main focus lies on questions of derandomisation, and we prove that there is a query which is definable in BPFO, the probabilistic version of first-order logic, but not in Cinf, finite variable infinitary  ...  This implies that many of the standard logics of finite model theory, like transitive closure logic and fixed-point logic, both with and without counting, cannot be derandomised.  ...  Acknowledgements We would like to thank Nicole Schweikardt and Dieter van Melkebeek for helpful comments on an earlier version of this paper.  ... 
doi:10.2168/lmcs-7(3:14)2011 fatcat:ez6mz5hh3fcoda6ka726764rre

An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal [article]

Henry Towsner
2018 arXiv   pre-print
Usually such methods are applied to problems involving dense graphs and hypergraphs; here we give the an extension of such methods to sparse but pseudorandom hypergraphs.  ...  We use this framework to give a proof of hypergraph removal for sub-hypergraphs of sparse random hypergraphs.  ...  Introduction In this paper we bring together two recent trends in extremal graph theory: the study of "sparse random" analogs of theorems about dense graphs, and the use of methods from analysis and logic  ... 
arXiv:1204.1884v5 fatcat:2nz4f74uwrf6plga6xuqd2ccnu

On digraph coloring problems and treewidth duality

Albert Atserias
2008 European journal of combinatorics (Print)  
The combination of this result with an older result by Nešetřil and Tardif shows that there is a computable listing of all template structures whose CSP is definable in full first-order logic.  ...  Using this, we illustrate the power of the logical approach to CSPs by resolving two conjectures about treewidth duality in the digraph case.  ...  Acknowledgement We thank Phokion Kolaitis, Jarik Nešetřil, and the referees of LICS 2005 for useful comments.  ... 
doi:10.1016/j.ejc.2007.11.004 fatcat:euiy3glnynhpvar6nzaif74nnq

JSL volume 62 issue 4 Cover and Back matter and Errata

1997 Journal of Symbolic Logic (JSL)  
use of its methods; and (4) studies in the history of logic.  ...  scientists, philosophers, linguists, and others interested in logic.  ...  Infinitary logics and very sparse random graphs 609 MACPHERSON, DUGALD. See HASKELL, DEIRDRE. MAGIDOR, MENACHEM. See FOREMAN, MATTHEW. MAKOWSKY, J. A. See ADAMEK, J.  ... 
doi:10.1017/s0022481200015565 fatcat:5fra5p2djfa2lilfcnzigmb5ea

Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability [article]

Mickel González Sánchez, Maksim Evgenievich Zhukovskii
2018 arXiv   pre-print
graphs G(n,n^-α) for some irrational α.  ...  quantifier depth of the first part of a monadic second-order sentence without asymptotic probability described by Jerzy Tyszkiewicz, which express the extension grid axiom in the Erdős-Rényi model of random  ...  Acknowledgment The authors wish to acknowledge fruitful discussions with A and B.  ... 
arXiv:1802.02671v3 fatcat:ubt3pgkoc5bwhgrzzwlmcwkjum

Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition [chapter]

Khodakhast Bibak
2013 Number Theory and Related Fields  
There are also very strong connections between ideas of additive combinatorics and the theory of random matrices (see [225, 226, 241] and the references therein); the latter have themselves several applications  ...  This newly emerging and captivating area of mathematics has recently found a great deal of remarkable applications to computer science and cryptography, for example, to the arenas of randomness extractors  ...  Acknowledgements The author would like to thank Igor Shparlinski for many invaluable comments and for his inspiration throughout the preparation of this survey and his unending encouragement.  ... 
doi:10.1007/978-1-4614-6642-0_4 fatcat:32mmqk4br5h6bhp2vzfhby7jme

An analytic approach to sparse hypergraphs: hypergraph removal

Henry Towsner
2018 Discrete Analysis  
We extend these methods to sparse but pseudorandom hypergraphs. We use this framework to give a proof of hypergraph removal for sub-hypergraphs of sparse random hypergraphs.  ...  The use of tools from analysis to address problems in graph theory has become an active area of research, using the construction of analytic limit objects from sequences of graphs and hypergraphs.  ...  Introduction In this paper we bring together two recent trends in extremal graph theory: the study of "sparse random" analogs of theorems about dense graphs, and the use of methods from analysis and logic  ... 
doi:10.19086/da.3104 fatcat:taocn6qodbdbdltu3tupoz3vdq

Subject index volumes 1–200

1999 Theoretical Computer Science  
words, 1354 pure codes, 2 I2 sparse matrices, 3092 well informed scheduler, 668 very-simple right and left -grammar, 758 V-gates, 702 in monotone networks, 186 Vbgvolgyi, Flilbp and -, 2937 in a database  ...  game, 2023 soliton automata, 1392, 1585 graph, 1585 graphs, 1585 paths, 1585 switching, 1392, 1585 valves, 1585 switching, logic aspects of -, 1392 Solovay and Strassen, 250 Baker, Gill and  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Limiting Properties of Random Graph Models with Vertex and Edge Weights

Sergey Foss, Takis Konstantopoulos
2018 Journal of statistical physics  
We also study sparse graph asymptotics, showing convergence of the weighted random graphs to a certain weighted graph that can be constructed in terms of Poisson processes.  ...  This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions.  ...  Sergey Foss thanks Ecole Polytechnique Fédérale de Lausanne for their hospitality and for providing excellent working conditions.  ... 
doi:10.1007/s10955-018-2080-3 fatcat:6j2dohik6zb6fh6xecc3s47fi4
« Previous Showing results 1 — 15 out of 84 results