Related papers: Priority arguments via true strages
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
We give a self-contained proof of the preservation theorem for proper countable support iterations known as "tools-preservation," "Case A" or "first preservation theorem" in the literature. We do not assume that the forcings add reals.
Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…
We show that the equational theory of the structure $\langle \omega^{\omega}: (x,y)\mapsto x+y, x\mapsto \omega x \rangle $ is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give…
Consider the property $(\aleph_{\omega + 1},\aleph_{\omega + 2},\ldots) \twoheadrightarrow (\aleph_1,\aleph_2,\ldots)$. Here we will show that this property with the addition of the General Continuum Hypothesis implies projective…
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…
Real-world Table-Text question answering (QA) tasks require models that can reason across long text and source tables, traversing multiple hops and executing complex operations such as aggregation. Yet existing benchmarks are small,…
We discuss first order systems of rational difference equations which have the property that lines through the origin are mapped into lines through the origin. We call such systems projective systems of rational difference equations and we…
We present an alternate proof of the passage from the finiteness principle for metric trees to the construction of the core in the C. Fefferman and Shvartsman finiteness theorem for Lipschitz selection problems.
This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
We present an abstract unifying framework for interpreting Stone-type dualities; several known dualities are seen to be instances of just one topos-theoretic phenomenon, and new dualities are introduced. In fact, infinitely many new…
We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one…
This contribution introduces a novel statistical learning methodology based on the Bradley-Terry method for pairwise comparisons, where the novelty arises from the method's capacity to estimate the worth of objects for a primary attribute…
We augment Assumption Based Argumentation (ABA for short) with weighted argumentation. In a nutshell, we assign weights to arguments and then derive the weight of attacks between ABA arguments. We illustrate our proposal through running…
We present Nonstandard Analysis by three axioms: the {\em Extension, Transfer and Saturation Principles} in the framework of the superstructure of a given infinite set. We also present several applications of this axiomatic approach to…
Good frames were suggested in [Sh:h] as the (bare-bones) parallel, in the context of AECs, to superstable (among elementary classes). Here we consider $(\mu,\lambda,\kappa)$-frames as candidates for being (in the context of AECs) the…