Literatura académica sobre el tema "Omega-categorical"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Índice
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Omega-categorical".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Omega-categorical"
ARCHER, RICHARD y DUGALD MACPHERSON. "Soluble omega-categorical groups". Mathematical Proceedings of the Cambridge Philosophical Society 121, n.º 2 (marzo de 1997): 219–27. http://dx.doi.org/10.1017/s0305004196001387.
Texto completoYang, Yanyun y Yan Xia. "Categorical Omega With Small Sample Sizes via Bayesian Estimation: An Alternative to Frequentist Estimators". Educational and Psychological Measurement 79, n.º 1 (18 de enero de 2018): 19–39. http://dx.doi.org/10.1177/0013164417752008.
Texto completoPalacín, Daniel. "On omega-categorical simple theories". Archive for Mathematical Logic 51, n.º 7-8 (4 de julio de 2012): 709–17. http://dx.doi.org/10.1007/s00153-012-0294-7.
Texto completoMOTTET, ANTOINE y MICHAEL PINSKER. "CORES OVER RAMSEY STRUCTURES". Journal of Symbolic Logic 86, n.º 1 (1 de febrero de 2021): 352–61. http://dx.doi.org/10.1017/jsl.2021.6.
Texto completoMAZARI-ARMIDA, MARCOS y SEBASTIEN VASEY. "UNIVERSAL CLASSES NEAR ${\aleph _1}$". Journal of Symbolic Logic 83, n.º 04 (diciembre de 2018): 1633–43. http://dx.doi.org/10.1017/jsl.2018.37.
Texto completoBodirsky, Manuel, Antoine Mottet, Miroslav Olšák, Jakub Opršal, Michael Pinsker y Ross Willard. "$\omega $-categorical structures avoiding height 1 identities". Transactions of the American Mathematical Society 374, n.º 1 (14 de octubre de 2020): 327–50. http://dx.doi.org/10.1090/tran/8179.
Texto completoKulpeshov, Beibut y Timur Mustafin. "ON DATABASE QUERIES OVER ALMOST OMEGA-CATEGORICAL ORDERED DOMAIN". Herald of Kazakh-British technical university 18, n.º 2 (1 de junio de 2021): 73–78. http://dx.doi.org/10.55452/1998-6688-2021-18-2-73-78.
Texto completoBraunfeld, Samuel. "Monadic stability and growth rates of ω$\omega$‐categorical structures". Proceedings of the London Mathematical Society 124, n.º 3 (23 de febrero de 2022): 373–86. http://dx.doi.org/10.1112/plms.12429.
Texto completoKulpeshov, B. Sh y S. V. Sudoplatov. "$${P}^{{*}}$$-Combinations of Almost $${\omega}$$-Categorical Weakly o-Minimal Theories". Lobachevskii Journal of Mathematics 42, n.º 4 (abril de 2021): 743–50. http://dx.doi.org/10.1134/s1995080221040132.
Texto completoKulpeshov, B. Sh y T. S. Mustafin. "Almost $ \omega $-Categorical Weakly $ o $-Minimal Theories of Convexity Rank 1". Siberian Mathematical Journal 62, n.º 1 (enero de 2021): 52–65. http://dx.doi.org/10.1134/s0037446621010067.
Texto completoTesis sobre el tema "Omega-categorical"
Aranda, López Andrés. "Omega-categorical simple theories". Thesis, University of Leeds, 2013. http://etheses.whiterose.ac.uk/7838/.
Texto completoBarbina, Silvia. "Automorphism groups of omega-categorical structures". Thesis, University of Leeds, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410638.
Texto completoBarsukov, Alexey. "On dichotomy above Feder and Vardi's logic". Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. https://tel.archives-ouvertes.fr/tel-04100704.
Texto completoA subset of NP is said to have a dichotomy if it contains problem that are either solvable in P-time or NP-complete. The class of finite Constraint Satisfaction Problems (CSP) is a well-known subset of NP that follows such a dichotomy. The complexity class NP does not have a dichotomy unless P = NP. For both of these classes there exist logics that are associated with them. -- NP is captured by Existential Second-Order (ESO) logic by Fagin's theorem, i.e., a problem is in NP if and only if it is expressible by an ESO sentence.-- CSP is a subset of Feder and Vardi's logic, Monotone Monadic Strict NP without inequalities (MMSNP), and for every MMSNP sentence there exists a P-time equivalent CSP problem. This implies that ESO does not have a dichotomy as well as NP, and that MMSNP has a dichotomy as well as CSP. The main objective of this thesis is to study subsets of NP that strictly contain CSP or MMSNP with respect to the dichotomy existence.Feder and Vardi proved that if we omit one of the three properties that define MMSNP, namely being monotone, monadic or omitting inequalities, then the resulting logic does not have a dichotomy. As their proofs remain sketchy at times, we revisit these results and provide detailed proofs. Guarded Monotone Strict NP (GMSNP) is a known extension of MMSNP that is obtained by relaxing the "monadic" restriction of MMSNP. We define similarly a new logic that is called MMSNP with Guarded inequalities, relaxing the restriction of being "without inequalities". We prove that it is strictly more expressive than MMSNP and that it also has a dichotomy.There is a logic MMSNP₂ that extends MMSNP in the same way as MSO₂ extends Monadic Second-Order (MSO) logic. It is known that MMSNP₂ is a fragment of GMSNP and that these two classes either both have a dichotomy or both have not. We revisit this result and strengthen it by proving that, with respect to having a dichotomy, without loss of generality, one can consider only MMSNP₂ problems over one-element signatures, instead of GMSNP problems over arbitrary finite signatures.We seek to prove the existence of a dichotomy for MMSNP₂ by finding, for every MMSNP₂ problem, a P-time equivalent MMSNP problem. We face some obstacles to build such an equivalence. However, if we allow MMSNP sentences to consist of countably many negated conjuncts, then we prove that such an equivalence exists. Moreover, the corresponding infinite MMSNP sentence has a property of being "regular". This regular property means that, in some sense, this sentence is still finite. It is known that regular MMSNP problems can be expressed by CSP on omega-categorical templates. Also, there is an algebraic dichotomy characterisation for omega-categorical CSPs that describe MMSNP problems. If one manages to extend this algebraic characterisation onto regular MMSNP, then our result would provide an algebraic dichotomy for MMSNP₂.Another potential way to prove the existence of a dichotomy for MMSNP₂ is to mimic the proof of Feder and Vardi for MMSNP. That is, by finding a P-time equivalent CSP problem. The most difficult part there is to reduce a given input structure to a structure of sufficiently large girth. For MMSNP and CSP, it is done using expanders, i.e., structures, where the distribution of tuples is close to a uniform distribution. We study this approach with respect to MMSNP₂ and point out the main obstacles. (...)