Switch to: References

Add citations

You must login to add citations.
  1. Fraïssé’s Conjecture in Π11-Comprehension.Antonio Montalbán - 2017 - Journal of Mathematical Logic 17 (2):1750006.
    We prove Fraïssé’s conjecture within the system of Π11-comprehension. Furthermore, we prove that Fraïssé’s conjecture follows from the Δ20-bqo-ness of 3 over the system of Arithmetic Transfinite Recursion, and that the Δ20-bqo-ness of 3 is a Π21-statement strictly weaker than Π11-comprehension.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Closed Choice and a Uniform Low Basis Theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.
  • Definability in the H -Quasiorder of Labeled Forests.Oleg V. Kudinov, Victor L. Selivanov & Anton V. Zhukov - 2009 - Annals of Pure and Applied Logic 159 (3):318-332.
    We prove that for any k≥3 each element of the h-quasiorder of finite k-labeled forests is definable in the ordinary first order language and, respectively, each element of the h-quasiorder of countable k-labeled forests is definable in the language Lω1ω, in both cases provided that the minimal non-smallest elements are allowed as parameters. As corollaries, we characterize the automorphism groups of both structures and show that the structure of finite k-forests is atomic. Similar results hold true for two other relevant (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark