Results 11 to 20 of about 2,014,608 (301)

Chain conditions, elementary amenable groups, and descriptive set theory [PDF]

open access: yes, 2016
We first consider three well-known chain conditions in the space of marked groups: the minimal condition on centralizers, the maximal condition on subgroups, and the maximal condition on normal subgroups. For each condition, we produce a characterization
Wesolek, Phillip, Williams, Jay
core   +4 more sources

ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY [PDF]

open access: yesThe Bulletin of Symbolic Logic, 2022
AbstractWe present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff–Kuratowski and Wadge theorems on the structure of $\mathbf {\Delta }^0_\xi $ , Louveau and Saint Raymond’s separation theorem, and Louveau’s separation theorem.
ADAM DAY   +3 more
openaire   +4 more sources

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY [PDF]

open access: yesJournal of Symbolic Logic (JSL), 2016
We study randomness beyond ${\rm{\Pi }}_1^1$-randomness and its Martin-Löf type variant, which was introduced in [16] and further studied in [3]. Here we focus on a class strictly between ${\rm{\Pi }}_1^1$ and ${\rm{\Sigma }}_2^1$ that is given by the ...
M. Carl, Philipp Schlicht
semanticscholar   +1 more source

A comparison of concepts from computable analysis and effective descriptive set theory [PDF]

open access: yesMathematical Structures in Computer Science, 2014
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting.
Vassilios Gregoriades   +2 more
semanticscholar   +1 more source

Non-deterministic computation and the Jayne-Rogers Theorem [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines.
Arno Pauly, Matthew de Brecht
doaj   +1 more source

Venn diagrams and probability in clinical research

open access: yesСеченовский вестник, 2020
Statistics is the science dealing with the collecting, summarizing and interpreting of associations in research data, and has a leading role in medical research.
N. М. Bulanov   +6 more
doaj   +1 more source

Balanced identity in the minimal groups paradigm. [PDF]

open access: yesPLoS ONE, 2013
Balanced Identity Theory [1] formalizes a set of relationships between group attitude, group identification, and self-esteem. While these relationships have been demonstrated for familiar and highly salient social categories, questions remain regarding ...
Yarrow Dunham
doaj   +1 more source

Amerykańskie koncepcje interpretacji konstytucji a rodzime teorie: klaryfikacyjna i derywacyjna. Próba porównania

open access: yesActa Iuris Stetinensis, 2022
The author set himself a goal of finding common elements of American concepts for the interpretation of the constitution and Polish descriptive-normative theories of legal interpretation of universal nature.
Paweł Boike
doaj   +1 more source

No Uncountable Polish Group Can be a Right-Angled Artin Group

open access: yesAxioms, 2017
We prove that if G is a Polish group and A a group admitting a system of generators whose associated length function satisfies: (i) if 0 < k < ω , then l g ( x ) ≤ l g ( x k ) ; (ii) if l g ( y ) < k < ω and x
Gianluca Paolini, Saharon Shelah
doaj   +1 more source

A survey on difference hierarchies of regular languages [PDF]

open access: yesLogical Methods in Computer Science, 2018
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages.
Olivier Carton   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy