Hasil untuk "math.LO"

Menampilkan 20 dari ~1228875 hasil · dari arXiv, DOAJ, CrossRef

JSON API
arXiv Open Access 2024
Path of pathology

Rafał Filipów, Jacek Tryba

We present a few results about (non)pathology of submeasures and ideals.

en math.LO, math.FA
arXiv Open Access 2024
Rigid Real Closed Fields

David Marker, Charles Steinhorn

We construct a non-Archimedean real closed field of transcendence degree two with no non-trivial automorphisms

en math.LO
arXiv Open Access 2022
A note on the series' of ordinal numbers

Marco Trombetti

The aim of this short note is to provide a proof to a statement of Sierpiński concerning the number of possible sums of a series (of type $λ<\aleph_1$) of arbitrary ordinal numbers.

en math.LO
CrossRef Open Access 2021
Formación docente en la cultura contemporánea: lo conveniente, lo deseable, lo posible

Silvia Irene Martinelli

El texto de la Dra. Forestello presenta e indaga, sobre la base de su tesis doctoral, los elementos para la Formación Docente en época de cultura digital. Desde sus inicios la tesis tuvo la intención de conectar la voz de experto/as en el campo de la Tecnología Educativa (TE) y la formación docente (FD), en el contexto de las políticas educativas públicas argentinas desde los ‘90 hasta la actualidad.

arXiv Open Access 2017
On a theorem of Magidor

Mohammad Golshani

Assuming $κ$ is a supercompact cardinal and $λ$ is an inaccessible cardinal above it, we present an idea due to Magidor, to find a generic extension in which $κ=\aleph_ω$ and $λ=\aleph_{ω+1}.$

en math.LO
arXiv Open Access 2013
Priority arguments via true strages

Antonio Montalbán

We describe a variation of Ash's $η$-system, and give a new proof of Ash's metatheorem. As an application, we prove a generalization of Ash and Knight's theorem on pairs of structures.

en math.LO
arXiv Open Access 2010
Exact bounds on epsilon processes

Toshiyasu Arai

In this paper we show that the lengths of the approximating processes in epsilon substitution method are calculable by ordinal recursions in an optimal way.

en math.LO
arXiv Open Access 1993
On hidden extenders

Moti Gitik

A model with a sequence of indiscernibles depending on a particular precovering set is constructed.The initial assumption is as follows: for every n<omega the set {alpha | o(alpha)=alpha^+n } is unbounded in kappa.

en math.LO

Halaman 18 dari 61444