Related papers: Long iterations for the continuum
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…
Explicit theory axioms are added by a saturation-based theorem prover as one of the techniques for supporting theory reasoning. While simple and effective, adding theory axioms can also pollute the search space with many irrelevant…
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…
Second-order self-force computations, which will be essential in modeling extreme-mass-ratio inspirals, involve two major new difficulties that were not present at first order. One is the problem of large scales, discussed in [Phys. Rev. D…
In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite…
We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
Given an arbitrary fixed continuously differentiable vector field on $\mathbb{R}^n$, we prove that this vector field is coercive if and only if its conservative part is coercive. We apply this result in order to provide sufficient…
In this paper, we intend to revisit Theorem 2 of [3] formulating it in a way that, weakening the hypotheses and, at the same time, highlighting the richer conclusion allowed by the proof, it can potentially be applicable to a broader range…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…
In an earlier paper we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the 'bifurcating continued fractions'.
Combining creature forcing approaches from arXiv:1003.3425 and arXiv:1402.0367, we show that, under CH, there is a proper $\omega^\omega$-bounding poset with $\aleph_2$-cc that forces continuum many pairwise different cardinal…
We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice…
We give another bit of evidence that forcing axioms provide proper framework for rigidity of quotient structures, by improving the OCA lifting theorem proved by the author in late 20th century and greatly simplifying its proof. In the…