ramsey theorem
Recently Published Documents


TOTAL DOCUMENTS

86
(FIVE YEARS 4)

H-INDEX

10
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Marta Fiori-Carones ◽  
Paul Shafer ◽  
Giovanni Soldà

2021 ◽  
Vol 62 (3) ◽  
Author(s):  
Damir Dzhafarov ◽  
Stephen Flood ◽  
Reed Solomon ◽  
Linda Westrick
Keyword(s):  

2021 ◽  
Vol 67 (1) ◽  
pp. 408-415
Author(s):  
Yannis Bousba ◽  
Travis Russell

2020 ◽  
Vol 34 (4) ◽  
pp. 2270-2281
Author(s):  
Peter Nelson ◽  
Sophia Park
Keyword(s):  

2019 ◽  
Vol 81 ◽  
pp. 142-149
Author(s):  
Nemanja Draganić ◽  
Dragan Mašulović
Keyword(s):  

2019 ◽  
Vol 69 (4) ◽  
pp. 729-738
Author(s):  
Dragan Mašulović ◽  
Bojana Pantić

Abstract In contrast to the abundance of “direct” Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a meaningful dual Ramsey result. In this paper we prove a dual Ramsey theorem for finite ordered oriented graphs. Instead of embeddings, which are crucial for “direct” Ramsey results, we consider a special class of surjective homomorphisms between finite ordered oriented graphs. Since the setting we are interested in involves both structures and morphisms, all our results are spelled out using the reinterpretation of the (dual) Ramsey property in the language of category theory.


2019 ◽  
Vol 29 (6) ◽  
pp. 881-911
Author(s):  
Wiesław Szwast ◽  
Lidia Tendera

Abstract We study the satisfiability problem for two-variable first-order logic over structures with one transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model property nor the tree model property, to show decidability we introduce a novel model construction technique based on the infinite Ramsey theorem. We also point out why the technique is not sufficient to obtain decidability for the full two-variable logic with one transitive relation; hence, contrary to our previous claim, [FO$^2$ with one transitive relation is decidable, STACS 2013: 317-328], the status of the latter problem remains open.


2019 ◽  
Vol 29 (4) ◽  
pp. 555-575 ◽  
Author(s):  
Stefano Berardi ◽  
Paulo Oliva ◽  
Silvia Steila

Abstract We present an effective proof (with explicit bounds) of the Podelski and Rybalchenko Termination Theorem. The sub-recursive bounds we obtain make use of bar recursion, in the form of the product of selection functions, as this is used to interpret the Weak Ramsey Theorem for pairs. The construction can be seen as calculating a modulus of well-foundedness for a given program given moduli of well-foundedness for the disjunctively well-founded finite set of covering relations. When the input moduli are in system T , this modulus is also definable in system T by a result of Schwichtenberg on bar recursion.


Sign in / Sign up

Export Citation Format

Share Document