相关论文: Iteration of lambda-complete forcing notions not c…
The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
In this paper, for an $\lambda$-strict pseudocontraction $T$, we prove strong convergence of the modified Mann's iteration defined by $$x_{n+1}=\beta_{n}u+\gamma_nx_n+(1-\beta_{n}-\gamma_n)[\alpha_{n}Tx_n+(1-\alpha_{n})x_n],$$ where…
We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…
We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…
We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.
We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…
We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…
In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.
This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…
In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…
While teaching untyped $\lambda$-calculus to undergraduate students, we were wondering why $\alpha$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a…
We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…