We show that it is consistent that Martin's axiom holds, the continuum is large, and yet the dual distributivity number ℌ is κ1. This answers a question of Halbeisen.

We give a new characterization of the class of completely representable cylindric algebras of dimension 2 #lt; n w via special neat embeddings. We prove an independence result connecting cylindric algebra to Martin''s axiom. Finally we apply our results to finite-variable first order logic showing that Henkin and Orey''s omitting types theorem fails for L n, the first order logic restricted to the first n variables when 2 #lt; n#lt;w. L n has been recently (and quite extensively) studied as (...) a many-dimensional modal logic. (shrink)

We deal with the consistency strength of ZFC + variants of MA + suitable sets of reals are measurable (and/or Baire, and/or Ramsey). We improve the theorem of Harrington and Shelah [2] repairing the asymmetry between measure and category, obtaining also the same result for Ramsey. We then prove parallel theorems with weaker versions of Martin's axiom (MA(σ-centered), (MA(σ-linked)), MA(Γ + ℵ 0 ), MA(K)), getting Mahlo, inaccessible and weakly compact cardinals respectively. We prove that if there exists (...) r ∈ R such that ω L[ r] 1 = ω 1 and MA holds, then there exists a ▵ 1 3 -selective filter on ω, and from the consistency of ZFC we build a model for ZFC + MA(I) + every ▵ 1 3 -set of reals is Lebesgue measurable, has the property of Baire and is Ramsey. (shrink)

It is shown that every locally countable upper semi-lattice of cardinality the continuum can be embedded into the Turing degrees, assuming Martin’s Axiom.

Martin's axiom is equivalent to the statement that the universe is absolute under ccc forcing extensions for Σ 1 sentences with a subset of $\kappa, \kappa , as a parameter.

We introduce the anti-rectangle refining property for forcing notions and investigate fragments of Martin’s axiom for ℵ1 dense sets related to the anti-rectangle refining property, which is close to some fragment of Martin’s axiom for ℵ1 dense sets related to the rectangle refining property, and prove that they are really weaker fragments.

We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.

Assuming an inaccessible cardinal $\kappa$ , there is a generic extension in which $MA + 2^{\aleph_0} = \kappa$ holds and the reals have a $\Delta^2_1$ well-ordering.

We show that either PFA + or Martin's maximum implies Fleissner's Axiom R, a reflection principle for stationary subsets of P ℵ 1 (λ). In fact, the "plus version" (for one term denoting a stationary set) of Martin's axiom for countably closed partial orders implies Axiom R.

We introduce a variant of Martin's axiom, called the grounded Martin's axiom, or math formula, which asserts that the universe is a c.c.c. forcing extension in which Martin's axiom holds for posets in the ground model. This principle already implies several of the combinatorial consequences of math formula. The new axiom is shown to be consistent with the failure of math formula and a singular continuum. We prove that math formula is preserved in (...) a strong way when adding a Cohen real and that adding a random real to a model of math formula preserves math formula. We also consider the analogous variant of the proper forcing axiom. (shrink)

We present a number of results involving almost disjoint sets and Martin's axiom. Included is an example, due to K. Kunen, of a c.c.c. partial order without property K whose product with every c.c.c. partial order is c.c.c.

A generalized version of Martin's axiom, called BACH, is shown to be equivalent to one of its combinatorial consequences, a generalization of P(c).

In the paper A non-implication between fragments of Martin’s Axiom related to a property which comes from Aronszajn trees , Proposition 2.7 is not true. To avoid this error and correct Proposition 2.7, the definition of the property is changed. In Yorioka [1], all proofs of lemmas and theorems but Lemma 6.9 are valid about this definition without changing the proofs. We give a new statement and a new proof of Lemma 6.9.

We continue the investigation of Gregory trees and the Cantor Tree Property carried out by Hart and Kunen. We produce models of MA with the Continuum arbitrarily large in which there are Gregory trees, and in which there are no Gregory trees.

We prove that the forcing axiom [Formula: see text] (stratified) implies [Formula: see text]. Using this implication, we show that the forcing axiom [Formula: see text] is inconsistent. We also derive weak Chang’s Conjecture from [Formula: see text] (stratified) and use this second implication to give another proof of the inconsistency of [Formula: see text].

Journal of Mathematical Logic, Ahead of Print. We prove that the forcing axiom [math] (stratified) implies [math]. Using this implication, we show that the forcing axiom [math] is inconsistent. We also derive weak Chang’s Conjecture from [math] (stratified) and use this second implication to give another proof of the inconsistency of [math].

In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.

We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 and for forcing notions with the (...) property fails. This negatively answers a part of one of the classical problems about implications between fragments of. (shrink)

Adding higher types to set theory differs from adding inaccessible cardinals, in that higher type arguments apply to all sets rather than just ordinary ones. Levy's reflection axiom is justified, by considering the principle that we can pretend that the universe is a set, together with methods of Gaifman [8]. We reprove some results of Gaifman, and some facts about Levy's reflection axiom, including the fact that adding higher types yields no new theorems about sets. Some remarks on (...) standard models are made. An obvious strengthening of Levy's axiom to higher types is considered, which implies the existence of indescribable cardinals. Other remarks about larger cardinals are made; some questions of Gloede [9] are settled. Finally we argue that the evidence for V = L is strong, and that CH is certainly true. MSC: 03E30, 03E55. (shrink)

Why was it that Francis Bacon, trained for high political office, devoted himself to proposing a celebrated and sweeping reform of the natural sciences? Julian Martin's investigative study looks at Bacon's family context, his employment in Queen Elizabeth's security service and his radical critique of the relationship between the Common Law and the Monarchy, to find the key to this important question. Deeply conservative and elitist in his political views, Bacon adapted Tudor strategies of State management and bureaucracy, the (...) social anxieties and prejudices of the late-Elizabethan governing elite, and a principal intellectual resource of the English governing classes - the Common Law - into a novel vision and method for the sciences. Bacon's axiom that 'Knowledge is Power' takes on far-reaching implications in Martin's challenging argument that the reform of natural philosophy was a central part of an audacious plan to strengthen the powers of the Crown in the State. (shrink)

There exist two notions of equivalence of behavior between states of a Labelled Markov Process (LMP): state bisimilarity and event bisimilarity. The first one can be considered as an appropriate generalization to continuous spaces of Larsen and Skou’s probabilistic bisimilarity, whereas the second one is characterized by a natural logic. C. Zhou expressed state bisimilarity as the greatest fixed point of an operator that there is such a process with an uncountable Zhou ordinal.

This chapter contains sections titled: Introduction: Questions of Meaning Theories of Meaning Language, Mind and Metaphysics: Questions of Priority Semantic Theories: Davidson's Programme Analysing the Concept of Meaning: Grice's Programme Pragmatics: Conversational Implicature and Relevance Theory.

Kurt Gödel is almost as famous—one might say “notorious”—for his extreme platonist views as he is famous for his mathematical theorems. Moreover his platonism is not a myth; it is well-documented in his writings. Here are two platonist declarations about set theory, the first from his paper about Bertrand Russell and the second from the revised version of his paper on the Continuum Hypotheses.Classes and concepts may, however, also be conceived as real objects, namely classes as “pluralities of things” or (...) as structures consisting of a plurality of things and concepts as the properties and relations of things existing independently of our definitions and constructions.It seems to me that the assumption of such objects is quite as legitimate as the assumption of physical bodies and there is quite as much reason to believe in their existence.But, despite their remoteness from sense experience, we do have something like a perception also of the objects of set theory, as is seen from the fact that the axioms force themselves upon us as being true. I don't see any reason why we should have less confidence in this kind of perception, i.e., in mathematical intuition, than in sense perception.The first statement is a platonist declaration of a fairly standard sort concerning set theory. What is unusual in it is the inclusion of concepts among the objects of mathematics. This I will explain below. The second statement expresses what looks like a rather wild thesis. (shrink)

The main result of this paper is a formal argument for the principle of maximizing expected utility that does not rely on the law of large numbers. Unlike the well-known arguments by Savage and von Neumann & Morgenstern, this argument does not presuppose the sure-thing principle or the independence axiom. The principal idea is to use the concept of transformative decision rules for decomposing the principle of maximizing expected utility into a sequence of normatively reasonable subrules. It is shown (...) that this procedure provides a resolution of Allais's paradox that cannot be obtained by Savage-style or von Neumann & Morgenstern-style arguments. (shrink)

This paper presents an axiomatization of the principle of maximizing expected utility that does not rely on the independence axiom or sure-thing principle. Perhaps more importantly the new axiomatization is based on an ex ante approach, instead of the standard ex post approach. An ex post approach utilizes the decision maker's preferences among risky acts for generating a utility and a probability function, whereas in the ex ante approach a set of preferences among potential outcomes are on the input (...) side of the theory and the decision maker's preferences among risky acts on the output side. (shrink)

This chapter contains section titled: Discussion.

In this article, we shall show the generalized notions of distributivity of Boolean algebras have essential relations with several axioms and properties of set theory, say the Axiom of Choice, the Axiom of Dependence Choice, the Prime Ideal Theorems, Martin's axioms, Lebesgue measurability and so on.

We will give a simple philosophical "proof" of the negation of Cantor's continuum hypothesis (CH). (A formal proof for or against CH from the axioms of ZFC is impossible; see Cohen [1].) We will assume the axioms of ZFC together with intuitively clear axioms which are based on some intuition of Stuart Davidson and an old theorem of Sierpinski and are justified by the symmetry in a thought experiment throwing darts at the real number line. We will in fact show (...) why there must be an infinity of cardinalities between the integers and the reals. We will also show why Martin's Axiom must be false, and we will prove the extension of Fubini's Theorem for Lebesgue measure where joint measurability is not assumed. Following the philosophy--if you reject CH you are only two steps away from rejecting the axiom of choice (AC)--we will point out along the way some extensions of our intuition which contradict AC. (shrink)

Introduction -- The end of history and the Kantian moment -- The progressive mind and the Islamist challenge -- The incoherence of the philosophers -- The language of progress and the closure of the European mind -- The networked global order -- All roads lead to China -- Maxims or axioms? -- The revenge of politics and the search for order -- Conclusion -- Afterword : the study of international relations and the erosion of acdemic integrity.

In [P. Larson, Martin’s Maximum and the axiom , Ann. Pure App. Logic 106 135–149], we modified a coding device from [W.H. Woodin, The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal, Walter de Gruyter & Co, Berlin, 1999] and the consistency proof of Martin’s Maximum from [M. Foreman, M. Magidor, S. Shelah, Martin’s Maximum. saturated ideals, and non-regular ultrafilters. Part I, Annal. Math. 127 1–47] to show that from a supercompact limit of supercompact cardinals one could (...) force Martin’s Maximum to hold while the axiom fails. Here we modify that argument to prove a stronger fact, that Martin’s Maximum is consistent with the existence of a wellordering of the reals definable in H without parameters, from the same large cardinal hypothesis. In doing so we give a much simpler proof of the original result. (shrink)

We show that Bounded Forcing Axioms (for instance, Martin's Axiom, the Bounded Proper Forcing Axiom, or the Bounded Martin's Maximum) are equivalent to principles of generic absoluteness, that is, they assert that if a $\Sigma_1$ sentence of the language of set theory with parameters of small transitive size is forceable, then it is true. We also show that Bounded Forcing Axioms imply a strong form of generic absoluteness for projective sentences, namely, if a $\Sigma^1_3$ sentence with (...) parameters is forceable, then it is true. Further, if for every real x, $x^{\sharp}$ exists, and the second uniform indiscernible is less than $\omega_2$ , then the same holds for $\Sigma^1_4$ sentences. (shrink)

Belnap–Dunn’s relevance logic, \(\textsf{BD}\), was designed seeking a suitable logical device for dealing with multiple information sources which sometimes may provide inconsistent and/or incomplete pieces of information. \(\textsf{BD}\) is a four-valued logic which is both paraconsistent and paracomplete. On the other hand, De and Omori, while investigating what classical negation amounts to in a paracomplete and paraconsistent four-valued setting, proposed the expansion \(\textsf{BD2}\) of the four valued Belnap–Dunn logic by a classical negation. In this paper, we introduce a four-valued expansion (...) of BD called \({\textsf{BD}^\copyright }\), obtained by adding an unary connective \({\copyright }\,\ \) which is a consistency operator (in the sense of the Logics of Formal Inconsistency, _LFI_s). In addition, this operator is the unique one with the following features: it extends to \(\textsf{BD}\) the consistency operator of LFI1, a well-known three-valued _LFI_, still satisfying axiom _ciw_ (which states that any sentence is either consistent or contradictory), and allowing to define an undeterminedness operator (in the sense of Logic of Formal Undeterminedness, _LFU_s). Moreover, \({\textsf{BD}^\copyright }\) is maximal w.r.t. LFI1, and it is proved to be equivalent to BD2, up to signature. After presenting a natural Hilbert-style characterization of \({\textsf{BD}^\copyright }\) obtained by means of twist-structures semantics, we propose a first-order version of \({\textsf{BD}^\copyright }\) called \({\textsf{QBD}^\copyright }\), with semantics based on an appropriate notion of four-valued Tarskian-like structures called \(\textbf{4}\) -structures. We show that in \({\textsf{QBD}^\copyright }\), the existential and universal quantifiers are interdefinable in terms of the paracomplete and paraconsistent negation, and not by means of the classical negation. Finally, a Hilbert-style calculus for \({\textsf{QBD}^\copyright }\) is presented, proving the corresponding soundness and completeness theorems. (shrink)

Belnap–Dunn’s relevance logic, \(\textsf{BD}\), was designed seeking a suitable logical device for dealing with multiple information sources which sometimes may provide inconsistent and/or incomplete pieces of information. \(\textsf{BD}\) is a four-valued logic which is both paraconsistent and paracomplete. On the other hand, De and Omori, while investigating what classical negation amounts to in a paracomplete and paraconsistent four-valued setting, proposed the expansion \(\textsf{BD2}\) of the four valued Belnap–Dunn logic by a classical negation. In this paper, we introduce a four-valued expansion (...) of BD called \({\textsf{BD}^\copyright }\), obtained by adding an unary connective \({\copyright }\,\ \) which is a consistency operator (in the sense of the Logics of Formal Inconsistency, _LFI_s). In addition, this operator is the unique one with the following features: it extends to \(\textsf{BD}\) the consistency operator of LFI1, a well-known three-valued _LFI_, still satisfying axiom _ciw_ (which states that any sentence is either consistent or contradictory), and allowing to define an undeterminedness operator (in the sense of Logic of Formal Undeterminedness, _LFU_s). Moreover, \({\textsf{BD}^\copyright }\) is maximal w.r.t. LFI1, and it is proved to be equivalent to BD2, up to signature. After presenting a natural Hilbert-style characterization of \({\textsf{BD}^\copyright }\) obtained by means of twist-structures semantics, we propose a first-order version of \({\textsf{BD}^\copyright }\) called \({\textsf{QBD}^\copyright }\), with semantics based on an appropriate notion of four-valued Tarskian-like structures called \(\textbf{4}\) -structures. We show that in \({\textsf{QBD}^\copyright }\), the existential and universal quantifiers are interdefinable in terms of the paracomplete and paraconsistent negation, and not by means of the classical negation. Finally, a Hilbert-style calculus for \({\textsf{QBD}^\copyright }\) is presented, proving the corresponding soundness and completeness theorems. (shrink)

We isolate natural strengthenings of Bounded Martin’s Maximum which we call ${\mathsf{BMM}}^{*}$ and $A-{\mathsf{BMM}}^{*,++}$, and we investigate their consequences. We also show that if $A-{\mathsf{BMM}}^{*,++}$ holds true for every set of reals $A$ in $L$, then Woodin’s axiom $$ holds true. We conjecture that ${\mathsf{MM}}^{++}$ implies $A-{\mathsf{BMM}}^{*,++}$ for every $A$ which is universally Baire.

We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which Bounded (...) Martin's Maximum fails. (shrink)

The purpose of this communication is to present some recent advances on the consequences that forcing axioms and large cardinals have on the combinatorics of singular cardinals. I will introduce a few examples of problems in singular cardinal combinatorics which can be fruitfully attacked using ideas and techniques coming from the theory of forcing axioms and then translate the results so obtained in suitable large cardinals properties.The first example I will treat is the proof that the proper forcing axiom (...) PFA implies the singular cardinal hypothesis SCH, this will easily lead to a new proof of Solovay's theorem that SCH holds above a strongly compact cardinal. I will also outline how some of the ideas involved in these proofs can be used as means to evaluate the “saturation” properties of models of strong forcing axioms like MM or PFA.The second example aims to show that the transfer principle ↠ fails assuming Martin's Maximum MM. Also in this case the result can be translated in a large cardinal property, however this requires a familiarity with a rather large fragment of Shelah's pcf-theory.Only sketchy arguments will be given, the reader is referred to the forthcoming [25] and [38] for a thorough analysis of these problems and for detailed proofs. (shrink)

We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly -game-closed forcings. PFA can be destroyed by a strongly -game-closed forcing but not by an ω2-closed.

The resurrection axioms are forms of forcing axioms that were introduced recently by Hamkins and Johnstone, who developed on earlier ideas of Chalons and Veličković. In this note, we introduce a stronger form of resurrection and show that it gives rise to families of axioms which are consistent relative to extendible cardinals, and which imply the strongest known instances of forcing axioms, such as Martin’s Maximum++. In addition, we study the unbounded resurrection postulates in terms of consistency lower bounds, obtaining, (...) for example, failures of the weak square principle. (shrink)