Related papers: Iterated Ultrapowers for the Masses
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
We study the structure of the Rudin-Frolik order on countably complete ultrafilters under the assumption that this order is directed. This assumption, called the Ultrapower Axiom, holds in all known canonical inner models. It turns out that…
A simple and algorithmic description of matrix shape invariant potentials is presented. The complete lists of generic matrix superpotentials of dimension $2\times2$ and of special superpotentials of dimension $3\times3$ are given…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
In this paper we generalize notions of iterated integral with regard to an unpredictable process. We establish a formula of integration by parts, the existence of a continuous modification and give an expression of the increasing process.
This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility…
We construct irreducible modules for twisted toroidal Lie algebras and extended affine Lie algebras. This is done by combining the representation theory of untwisted toroidal algebras with the technique of thin coverings of modules. We…
Higher order automorphic forms have recently been introduced to study important questions in number theory and mathematical physics. We investigate the connection between these functions and Chen's iterated integrals. Then using Chen's…
We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
The inferential model (IM) framework produces data-dependent, non-additive degrees of belief about the unknown parameter that are provably valid. The validity property guarantees, among other things, that inference procedures derived from…
An ultraproduct can be a helpful organizing principle in presenting solutions of problems at many levels, as argued by Terence Tao. We apply it here to the solution of a calculus problem: every infinite sequence has a monotone infinite…
We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…
The paper gives a detailed presentation of a framework, embedded into the simply typed higher-order logic and aimed at the support of sound and structured reasoning about various properties of models of imperative programs with interleaved…
This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…
In this paper, we investigate the extrapolation capabilities of implicit deep learning models in handling unobserved data, where traditional deep neural networks may falter. Implicit models, distinguished by their adaptability in layer…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
This paper considers the structure of uncertain linear systems building on concepts of robust unobservability and possible controllability which were introduced in previous papers. The paper presents a new geometric characterization of the…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…