Source author record

Miguel Moreno

Miguel Moreno appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

math.LO Artificial Intelligence Logic in Computer Science nlin.CD

Catalog footprint

What is connected

6works

4topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Complex transitions between spiking, bursting and silent regimes in a new memristive Rulkov neuronal model

The Rulkov model, which simulates the behavior of biological neurons, is modified by replacing one of its control parameters with a memristive, sigmoid-type function of finite memory. This modification causes the parameter to vary according to the system's history throughout the simulation. Previous works usually modify the Rulkov model by introducing additional parameters altering its behavior. Here, by contrast, we retain the original equations and allow the control parameters to vary in time, thereby preserving the model's fundamental properties. In this sense, the proposed model is locally equivalent in time to the original one. However, unlike the original model, which reproduces a single neuronal regime per simulation, the new memristive version exhibits both uniform and chaotic transitions among multiple neuronal activity regimes. Its dynamics are examined with respect to the rate at which the memristive function changes and the number of internal states it stores. Three distinct scenarios emerge around a bifurcation point. Before the bifurcation, the system undergoes uniform transitions toward a stable bursting regime. After the bifurcation, it shows uniform transitions toward a final spiking or silent regime. At the bifurcation point, highly complex transitions arise. As examples, we present trajectories in which the neuron chaotically switches between regimes without ever settling, and trajectories for which it requires around 140000 map iterations to reach a stationary regime.

preprint2026arXiv

Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization

We give a novel logical characterization of encoder-decoder transformers, the foundational architecture for LLMs that also sees use in various settings that benefit from cross-attention. We study such transformers over text in the practical setting of floating-point numbers and soft-attention, characterizing them with a new temporal logic. This logic extends propositional logic with a counting global modality over the encoder input and a past modality over the decoder input. We also give an additional characterization of such transformers via a type of distributed automata, and show that our results are not limited to the specific choices in the architecture and can account for changes in, e.g., masking. Finally, we discuss encoder-decoder transformers in the autoregressive setting.

preprint2020arXiv

Fake reflection

We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection from ZFC, and present applications of filter reflection to the study of canonical equivalence relations of the higher Cantor and Baire spaces.

preprint2020arXiv

Inclusion modulo nonstationary

A classical theorem of Hechler asserts that the structure $\left(ω^ω,\le^*\right)$ is universal in the sense that for any $σ$-directed poset P with no maximal element, there is a ccc forcing extension in which $\left(ω^ω,\le^*\right)$ contains a cofinal order-isomorphic copy of P. In this paper, we prove a consistency result concerning the universality of the higher analogue $\left(κ^κ,\le^S\right)$: Theorem. Assume GCH. For every regular uncountable cardinal $κ$, there is a cofinality-preserving GCH-preserving forcing extension in which for every analytic quasi-order Q over $κ^κ$ and every stationary subset S of $κ$, there is a Lipschitz map reducing Q to $(κ^κ,\le^S)$.

preprint2016arXiv

A Borel-reducibility Counterpart of Shelah's Main Gap Theorem

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is strictly above the isomorphism of models of T with respect to Borel-reducibility. In fact, we can also ensure that a range of equivalence relations modulo various non-stationary ideals are strictly between those isomorphism relations. The isomorphism relations are considered on models of some fixed uncountable cardinality obeying certain restrictions.

preprint2015arXiv

On the reducibility of isomorphism relations

We study the Borel reducibility of isomorphism relations in the generalized Baire space $κ^κ$. In the main result we show for inaccessible $κ$, that if $T$ is a classifiable theory and $T'$ is stable with OCP, then the isomorphism of models of $T$ is Borel reducible to the isomorphism of models of $T'$.