We define a structure which is much simpler than a morass, but whose existence is equivalent to the existence of a morass.

We show that a $$ -simplified morass can be added by a forcing with working parts of size smaller than $\kappa $. This answers affirmatively the question, asked independently by Shelah and Velleman in the early 1990s, of whether it is possible to do so.Our argument use a modification of a technique of Mitchell’s for adding objects of size $\omega _2$ in which collections of models – all of equal, countable size – are used as side conditions. In (...) our modification, whilst the individual models are, as in Mitchell’s technique, taken ad hoc from quite general classes, the collections of models are very highly structured, in a way that is somewhat different from, perhaps more stringent than, Mitchell’s original, arguably making the method more wieldy and giving the prospect of further uses with more delicate working parts. (shrink)

This paper concerns the theory of morasses. In the early 1970s Jensen defined (κ,α)-morasses for uncountable regular cardinals κ and ordinals $\alpha . In the early 1980s Velleman defined (κ, 1)-simplified morasses for all regular cardinals κ. He showed that there is a (κ, 1)-simplified morass if and only if there is (κ, 1)-morass. More recently he defined (κ, 2)-simplified morasses and Jensen was able to show that if there is a (κ, 2)-morass then (...) there is a (κ, 2)-simplified morass. In this paper we prove the converse of Jensen's result, i.e., that if there is a (κ, 2)-simplified morass then there is a (κ, 2)-morass. (shrink)

We show how to construct Gitik’s short extenders gap-3 forcing using a morass, and that the forcing notion is of Prikry type.

We prove that in the Cohen extension adding ℵ3 generic reals to a model of containing a simplified (ω1, 2)‐morass, gap‐2 morass‐definable η1‐orderings with cardinality ℵ3 are order‐isomorphic. Hence it is consistent that and that morass‐definable η1‐orderings with cardinality of the continuum are order‐isomorphic. We prove that there are ultrapowers of over ω that are gap‐2 morass‐definable. The constructions use a simplified gap‐2 morass, and commutativity with morass‐maps and morass‐embeddings, to extend (...) a transfinite back‐and‐forth construction of order‐type ω1 to an order‐preserving bijection between objects of cardinality ℵ3. (shrink)

We further develop a previously introduced method of constructing forcing notions with the help of morasses. There are two new results: (1) If there is a simplified (ω 1 , 1)-morass, then there exists a ccc forcing of size ω 1 that adds an ω 2 -Suslin tree. (2) If there is a simplified (ω 1 , 2)-morass, then there exists a ccc forcing of size ω 1 that adds a 0-dimensional Hausdorff topology τ on ω (...) 3 which has spread s(τ) = ω 1 . While (2) is the main result of the paper, (1) is only an improvement of a previous result, which is based on a simple observation. Both forcings preserve GCH. To show that the method can be changed to produce models where CH fails, we give an alternative construction of Koszmider's model in which there is a chain 〈X α | α < ω 2 〉 such that X α ⊆ ω 1 , X β — X α is finite and X α — X β has size ω 1 for all β < α < ω 2. (shrink)

By using the notion of a simplified (κ,1)-morass, we construct κ-thin-tall, κ-thin-thick and, in a forcing extension, κ-very thin-thick superatomic Boolean algebras for every infinite regular cardinal κ.

is a (κ, 1)-simplified morass if θα | α < κ is an increasing sequence of ordinals less than κ, θκ = κ+, and each Fαβ is a collection of maps from θα to θβ such that the following properties hold.

In this paper we prove that, in the Cohen extension of a model M of ZFC+CH containing a simplified -morass, η1-orderings without endpoints having cardinality of the continuum, and satisfying specified technical conditions, are order-isomorphic. Furthermore, any order-isomorphism in M between countable subsets of the η1-orderings can be extended to an order-isomorphism between the η1-orderings in the Cohen extension of M. We use the simplified -morass, and commutativity conditions with morass maps on terms in the (...) forcing language, to extend countable partial functions on terms in the forcing language that are forced in all generic extensions to be order-preserving injections. This technique provides for the construction of functions in Cohen extensions adding 2 generic reals for which the only known arguments require transfinite constructions of order type no greater than ω1 in models of ZFC+CH. The specific example presented in this paper is an extension of Tarski’s classic result that in models of ZFC+CH, η1-orderings are order-isomorphic. (shrink)

Local connectedness functions for (κ, 1)-simplified morasses, localisations of the coupling function c studied in [M96, §1], are defined and their elementary properties discussed. Several different, useful, canonical ways of arriving at the functions are examined. This analysis is then used to give explicit formulae for generalisations of the local distance functions which were defined recursively in [K00], leading to simple proofs of the principal properties of those functions. It is then extended to the properties of local connectedness functions (...) in the context of κ-M-proper forcing for sucessor κ. The functions are shown to enjoy substantial strengthenings of the properties (particularly the ∆-properties) hitherto proved for both c and for Todorcevic’s ρ-functions in the special case κ = ω1. A couple of examples of the use of local connectedness functions in consort with κ-M-proper forcing are then given. (shrink)

Some subfamilies of κ, for κ regular, κ λ, called -semimorasses are investigated. For λ = κ+, they constitute weak versions of Velleman's simplified -morasses, and for λ > κ+, they provide a combinatorial framework which in some cases has similar applications to the application of -morasses with this difference that the obtained objects are of size λ κ+, and not only of size κ+ as in the case of morasses. New consistency results involve existence of nonreflecting objects of (...) singular sizes of uncountable cofinality such as a nonreflecting stationary set in κ, a nonreflecting nonmetrizable space of size λ, a nonreflecting nonspecial tree of size λ. We also characterize possible minimal sizes of nonspecial trees without uncountable branches. (shrink)

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman’s neat simplified morasses called 2-cardinals. The theory of related trees, gaps, colorings of pairs and forcing notions is reformulated and sketched from a unifying point of view with the focus on the applicability to constructions of mathematical structures like Boolean algebras, Banach spaces or compact spaces. The paper (...) is dedicated to the memory of Jim Baumgartner whose seminal joint paper :109–129, 1987) with Saharon Shelah provided a critical mass in the theory in question. A new result which we obtain as a side product is the consistency of the existence of a function \ with the appropriate \-version of property \ for regular \ satisfying \. (shrink)

Dan Talayco has recently defined the gap cohomology group of a tower in p/fin of height ω1. This group is isomorphic to the collection of gaps in the tower modulo the equivalence relation given by two gaps being equivalent if their levelwise symmetric difference is not a gap in the tower, the group operation being levelwise symmetric difference. Talayco showed that the size of this group is always at least 2N0 and that it attains its greatest possible size, 2N1, if (...) ⋄ holds and also in some generic extensions in which CH fails, for example on adding many Cohen or random reals. In this paper it is shown that there is always some tower whose gap cohomology group has size 2N1. It is still open as to whether there are models in which there are towers whose gap cohomology group has size less than 2ω1. (shrink)

Assume that M is a transitive model of $ZFC+CH$ containing a simplified $(\omega _1,2)$ -morass, $P\in M$ is the poset adding $\aleph _3$ generic reals and G is P-generic over M. In M we construct a function between sets of terms in the forcing language, that interpreted in $M[G]$ is an $\mathbb R$ -linear order-preserving monomorphism from the finite elements of an ultrapower of the reals, over a non-principal ultrafilter on $\omega $, into the Esterle algebra of formal (...) power series. Therefore it is consistent that $2^{\aleph _0}>\aleph _2$ and, for any infinite compact Hausdorff space X, there exists a discontinuous homomorphism of $C(X)$, the algebra of continuous real-valued functions on X. (shrink)

In principle, a proof can be any sequence of logical deductions from axioms and previously-proved statements that concludes with the proposition in question. This freedom in constructing a proof can seem overwhelming at first. How do you even start a proof? Here’s the good news: many proofs follow one of a handful of standard templates. Proofs all differ in the details, of course, but these templates at least provide you with an outline to fill in. We’ll go through several of (...) these standard patterns, pointing out the basic idea and common pitfalls and giving some examples. Many of these templates fit together; one may give you a top-level outline while others help you at the next level of detail. And we’ll show you other, more sophisticated proof techniques later on. The recipes below are very specific at times, telling you exactly which words to write down on your piece of paper. You’re certainly free to say things your own way instead; we’re just giving you something you could say so that you’re never at a complete loss. (shrink)

BackgroundSocial cognition and competence are a key part of daily interactions and essential for satisfying relationships and well-being. Pediatric neurological and psychological conditions can affect social cognition and require assessment and remediation of social skills. To adequately approximate the complex and dynamic nature of real-world social interactions, innovative tools are needed. The aim of this study was to document the performance of adolescents on two versions of a serious video game presenting realistic, everyday, socio-moral conflicts, and to explore whether their (...) performance is associated with empathy or sense of presence, factors known to influence social cognition.MethodsParticipants first completed a pre-test measure of socio-moral reasoning based on three dilemmas from a previously validated computer task. Then, they either played an evaluative version or an adaptive version of a video game presenting nine social situations in which they made socio-moral decisions and provided justifications. In the evaluative version, participants’ audio justifications were recorded verbatim and coded manually to obtain a socio-moral reasoning maturity score. In the adaptive version, tailored feedback and social reinforcements were provided based on participant responses. An automatic coding algorithm developed using artificial intelligence was used to determine socio-moral maturity level in real-time and to provide a basis for the feedback and reinforcements in the game. All participants then completed a three-dilemma post-test assessment.ResultsThose who played the adaptive version showed improved SMR across the pre-test, in-game and post-test moral maturity scores, F = 9.81, pHF < 0.001, ϵ2 = 0.21, but those who played the Evaluative version did not. Socio-moral reasoning scores from both versions combined did not correlate with empathy or sense of presence during the game, though results neared significance. The study findings support preliminary validation of the game as a promising method for assessing and remediating social skills during adolescence. (shrink)

This paper shows that the relevant logics E and Π′ are strongly sound and complete with regards to a version of the “simplified” Routley-Meyer semantics. Such a semantics for E has been thought impossible. Although it is impossible if an admissible rule of E – the rule of restricted assertion or equivalently Ackermann’s δ-rule – is solely added as a primitiverule, it is very much possible when E is axiomatized in the way Anderson and Belnap did. The simplified (...) semantics for E and Π′ requires unreduced frames. Contra what has been claimed, however, no additional frame component is required over and above what’s required to model other relevant logics such as T and R. It is also shown how to modify the tonicity requirements of theternary relation so as to allow for the standard truth condition for both fusion – the intensional conjunction◦ – as well as the converse conditional ←. (shrink)

This paper continues the work of Priest and Sylvan in Simplified Semantics for Basic Relevant Logics, a paper on the simplified semantics of relevant logics, such as B⁺ and B. We show that the simplified semantics can also be used for a large number of extensions of the positive base logic B⁺, and then add the dualising '*' operator to model negation. This semantics is then used to give conservative extension results for Boolean negation.

We give a simplified version of the system introduced in ‘Non-Redundancy’, presented here as a Modal Logic whose primitive elements are finite sequences. It includes a treatment of Condition C, Condition B, Condition A, and the Locality of Variable Binding, but disregards quantification and Weak and Strong Crossover effects, which are treated in the longer paper.

This paper shows that the relevant logics E and Π′ are strongly sound and complete with regards to a version of the “simplified” Routley-Meyer semantics. Such a semantics for E has been thought impossible. Although it is impossible if an admissible rule of E  the rule of restricted assertion or equivalently Ackermann’s δ-rule  is solely added as a primitive rule, it is very much possible when E is axiomatized in the way Anderson and Belnap did. The (...) class='Hi'>simplified semantics for E and Π′ requires unreduced frames. Contra what has been claimed, however, no additional frame component is required over and above what’s required to model other relevant logics such as T and R. It is also shown how to modify the tonicity requirements of the ternary relation so as to allow for the standard truth condition for both fusion – the intensional conjunction ◦ – as well as the converse conditional ←. (shrink)

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowing the definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions and disjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth –what Anderson (...) and Belnap called the “world” constant. (shrink)

Reporting systems based on mobile technologies and feedback from regular citizens are becoming increasingly popular, especially as far as protection of environmental and cultural heritage is concerned. Reporting life-threatening situations, such as sudden natural disasters or traffic accidents, belongs to the same class of problems and could be aided by IT systems of a similar architecture. Designing and developing systems for reporting life-threatening situations is not a trivial task, requiring close cooperation between software developers and experts in different domains, who (...) could possibly find industrially recognized languages and notations difficult. Thus, the question is whether using simplified graphical domain-specific languages (SGDSLs) could help in creating a common communication platform. It has been revealed that domain experts have a preference for such languages as they offer good learnability, readability and ability to focus on the idea of application. The perspective of developers (technical persons) is introduced on the basis of feedback obtained from 84 students of Computer Science at the Lublin University of Technology, who attended comprehensive workshops followed by an anonymous survey. All participants received theoretical and practical training in modeling mobile software using the same set of languages as domain experts. An analysis of the results revealed that opinions expressed by technical and nontechnical persons concerning SGDSLs oriented on defining a flow of actions is consistent. Most respondents claimed that such languages might be valuable as tools for creating a common communication platform. (shrink)

Excerpt from Psychology Simplified The dormant condition of the avenues in the brain is the only thing intervening between man and the solution of psychic manifestations. Mind can remove the existing conditions in the brain and put man in touch with the solu tion of these things. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology (...) to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. (shrink)

A simplified variant of Gödel’s ontological argument is presented. The simplified argument is valid already in basic modal logics K or KT, it does not suffer from modal collapse, and it avoids the rather complex predicates of essence (Ess.) and necessary existence (NE) as used by Gödel. The variant presented has been obtained as a side result of a series of theory simplification experiments conducted in interaction with a modern proof assistant system. The starting point for these experiments (...) was the computer encoding of Gödel’s argument, and then automated reasoning techniques were systematically applied to arrive at the simplified variant presented. The presented work thus exemplifies a fruitful human-computer interaction in computational metaphysics. Whether the presented result increases or decreases the attractiveness and persuasiveness of the ontological argument is a question I would like to pass on to philosophy and theology. (shrink)

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowingthe definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions anddisjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth – what Anderson and (...) Belnap called the “world” constant. (shrink)

A topological duality is presented for a wide class of lattice-ordered structures including lattice-ordered groups. In this new approach, which simplifies considerably previous results of the author, the dual space is obtained by endowing the Priestley space of the underlying lattice with two binary functions, linked by set-theoretical complement and acting as symmetrical partners. In the particular case of l-groups, one of these functions is the usual product of sets and the axiomatization of the dual space is given by very (...) simple first-order sentences, saying essentially that both functions are associative and that the space is a residuated semigroup with respect to each of them. (shrink)

This article presents a simplified proof of the result that bounded depth propositional proofs of the pigeonhole principle are exponentially large. The proof uses the new techniques for proving switching lemmas developed by Razborov and Beame. A similar result is also proved for some examples based on graphs.

This paper shows that a recent, simplified version of St. Anselm's proof of the existence of God has its flank open to Gaunilo's objection. Reformulating Anselm's line of reasoning in terms of the distinction between mediated and unmediated causal powers, as the simplified proof does, makes it harder for Anselm's supporters to refute the objection that the ontological argument absurdly entails the existence of all kinds of fictional entities.

This article draws on Principles of Stakeholder Managementrecently published by the Clarkson Centre for Business Ethics. The article discusses the most important principles and the reasoning behind them. First, though, it lays a foundation for the application of these principles by interpreting a massive empirical study that demonstrates strong parallels between stakeholder valuation of firms (measured as overall reputation) and shareholder valuation (stock market returns). This evidence is coupled with conceptual analysis that shows that the most famous pronouncements of Adam (...) Smith and Milton Friedman actually argue for, not against, the stakeholder approach. (shrink)

We show how to correct the analytic tableaux system from the paper Olkhovikov and Wansing, 259–279, 2018).

The goal of the paper is to present a Simplified Offensive Language (SOL) Taxonomy, its application and testing in the Second Annotation Campaign conducted between March-May 2023 on four languages: English, Czech, Lithuanian, and Polish to be verified and located in LLOD. Making reference to the previous Offensive Language taxonomic models proposed mostly by the same COST Action Nexus Linguarum WG 4.1.1 team, the number and variety of the categories underwent the definitional revision, and the present typology was tested (...) in the annotation on the publicly available offensive language datasets of each of the four languages. The results of the annotation are presented and as they are contained within the accepted statistical values on the inter-annotator agreement in the SOL categories and their aspects, we propose this taxonomy as a core ontology which represents the encoding of the supported offensive languages and justify its use on new data in terms of a more universal Linguistic Linked Open Data (LLOD) schema. (shrink)

We introduce a novel point of view on the “models as mediators” framework in order to emphasize certain important epistemological questions about models in science which have so far been little investigated. To illustrate how this perspective can help answer these kinds of questions, we explore the use of simplified models in high energy physics research beyond the Standard Model. We show in detail how the construction of simplified models is grounded in the need to mitigate pressing epistemic (...) problems concerning the uncertainty inherent in the present theoretical and experimental contexts. (shrink)

We give a simplified treatment of revised countable support (RCS) forcing iterations, previously considered by Shelah (see [Sh, Chap. X]). In particular we prove the fundamental theorem of semi-proper forcing, which is due to Shelah: any RCS iteration of semi-proper posets is semi-proper.

We illustrate an explicit counterexample to Bell's theorem by constructing a pair of spin variables within S^3 that exactly reproduces the EPR-Bohm correlation in a manifestly local-realistic manner.

In this book a noted physiologist and neuroscientist introduces the concept of simplexity, the set of solutions living organisms find that enable them to deal with information and situations, while taking into account past experiences and anticipating future ones. Such solutions are new ways of addressing problems so that actions may be taken more quickly, more elegantly, and more efficiently. In a sense, the history of living organisms may be summed up by their remarkable ability to find solutions that avoid (...) the world's complexity by imposing on it their own rules and functions. Evolution has resolved the problem of complexity not by simplifying but by finding solutions whose processes--though they can sometimes be complex--allow us to act in the midst of complexity and of uncertainty. Nature can inspire us by making us realize that simplification is never simple and requires instead that we choose, refuse, connect, and imagine, in order to act in the best possible manner. Such solutions are already being applied in design and engineering and are significant in biology, medicine, economics, and the behavioral sciences. (shrink)

Doxastic dualists acknowledge both outright beliefs and credences, and they maintain that neither state is reducible to the other. This gives rise to the ‘Bayesian Challenge’, which is to explain why we need beliefs if we have credences already. On a popular dualist response to the Bayesian Challenge, we need beliefs to simplify our reasoning. I argue that this response fails because credences perform this simplifying function at least as well as beliefs do.