Related papers: Lords of the iteration
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
We develop librationism, {\pounds}, and clarify some mathematical and philosophical matters which relate to the particular manner in which it deals with the paradoxes and to its usefulness as a foundation for mathematics and type free…
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 study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
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$.
We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.
We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…
For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…
We study the properties, in particular termination, of dependent types systems for lambda calculus and rewriting.
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
Over the past two decades the notion of a strong monad has found wide applicability in computing. Arising out of a need to interpret products in computational and semantic settings, different approaches to this concept have arisen. In this…
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…
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…
We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section…
This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…