Related papers: The exact strength of the class forcing theorem
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
In this paper, we provide a complete classification for the first-order Goedel logics concerning the property that the formulas admit logically equivalent prenex normal forms. We show that the only first-order Goedel logics that admit such…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often to be applied in areas such as mathematical economics or…
Cross-situational word learning is based on the notion that a learner can determine the referent of a word by finding something in common across many observed uses of that word. Here we propose an adaptive learning algorithm that contains a…
Given a $p$-group $G$ and a subgroup-closed class $\mathfrak{X}$, we associate with each $\mathfrak{X}$-subgroup $H$ certain quantities which count $\mathfrak{X}$-subgroups containing $H$ subject to further properties. We show in Theorem I…
Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise)…
We investigate the effects of various forcings on several forms of the Halpern-L\"auchli Theorem. For inaccessible $\kappa$, we show they are preserved by forcings of size less than $\kappa$. Combining this with work of Zhang in…
Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…
We study descriptive complexity of counting complexity classes in the range from #P to #$\cdot$NP. A corollary of Fagin's characterization of NP by existential second-order logic is that #P can be logically described as the class of…
This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation,…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…