_Edusemiotics_ addresses an emerging field of inquiry, educational semiotics, as a philosophy of and for education. Using "sign" as a unit of analysis, educational semiotics amalgamates philosophy, educational theory and semiotics. Edusemiotics draws on the intellectual legacy of such philosophers as John Dewey, Charles Sanders Peirce, Gilles Deleuze and others across Anglo-American and continental traditions. This volume investigates the specifics of semiotic knowledge structures and processes, exploring current dilemmas and debates regarding self-identity, learning, transformative and lifelong education, leadership and policy-making, (...) and interrogating an important premise that still haunts contemporary educational philosophy: Cartesian dualism. In defiance of substance dualism and the fragmentation of knowledge that still inform education, the book offers a unifying paradigm for education as edusemiotics and emphasises ethical education in compliance with the semiotic unity between knowledge and action. Chapters contain accessible discussions in the context of educational philosophy and theory, crossing the borders between logic, art, and science together with a provocative theoretical critique. Recently awarded a PESA book award for its contribution to the philosophy of education, _Edusemiotics_ will appeal to an academic readership in education, philosophy and cultural studies, while also being an inspiring resource for students. (shrink)

This paper aims to explain how semiotics and constructivism can collaborate in an educational epistemology by developing a joint approach to prescientific conceptions. Empirical data and findings of constructivist research are interpreted in the light of Peirce’s semiotics. Peirce’s semiotics is an anti-psychologistic logic and relational logic. Constructivism was traditionally developed within psychology and sociology and, therefore, some incompatibilities can be expected between these two schools. While acknowledging the differences, we explain that constructivism and semiotics share the assumption of realism (...) that knowledge can only be developed upon knowledge and, therefore, an epistemological collaboration is possible. The semiotic analysis performed confirms the constructivist results and provides a further insight into the teacher-student relation. Like the constructivist approach, Peirce’s doctrine of agapism infers that the personal dimension of teaching must not be ignored. Thus, we argue for the importance of genuine sympathy in teaching attitudes. More broadly, the article also contributes to the development of postmodern humanities. At the end of the modern age, the humanities are passing through a critical period of transformation. There is a growing interest in semiotics and semiotic philosophy in many areas of the humanities. Such a case, on which we draw, is the development of a theoretical semiotic approach to education, namely edusemiotics. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human (...) reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

We generalize the \}\)-canonical formulas to \}\)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by \}\)-canonical rules. This yields a convenient characterization of stable superintuitionistic logics. The \}\)-canonical formulas are analogues of the \}\)-canonical formulas, which are the algebraic counterpart of Zakharyaschev’s canonical formulas for superintuitionistic logics. Consequently, stable si-logics are analogues of subframe si-logics. We introduce cofinal stable intuitionistic multi-conclusion consequence relations and cofinal stable si-logics, thus (...) answering the question of what the analogues of cofinal subframe logics should be. This is done by utilizing the \}\)-reduct of Heyting algebras. We prove that every cofinal stable si-logic has the finite model property, and that there are continuum many cofinal stable si-logics that are not stable. We conclude with several examples showing the similarities and differences between the classes of stable, cofinal stable, subframe, and cofinal subframe si-logics. (shrink)

In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of frames, that NNIL-formulas are subframe formulas, and that subframe logics can be axiomatized by NNIL-formulas. We also define a new syntactic class of ONNILLI-formulas. We show that these are the formulas preserved in monotonic (...) images of frames and that ONNILLI-formulas are stable formulas as introduced by Bezhanishvili and Bezhanishvili in 2013. Thus, ONNILLI is a syntactically defined set of formulas axiomatizing all stable logics. This resolves a problem left open in 2013. (shrink)

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

In this paper we present stable and unstable versions of several well-known relations from mereotopology: part-of, overlap, underlap and contact. An intuitive semantics is given for the stable and unstable relations, describing them as dynamic counterparts of the base mereotopo-logical relations. Stable relations are described as ones that always hold, while unstable relations hold sometimes. A set of first-order sentences is provided to serve as axioms for the stable and unstable relations, and representation theory is developed (...) in similar fashion to Stone’s representation theory for Boolean algebras and distributive lattices. Then we present some results about the first-order predicate logic of these relations and about its quantifier-free fragment. Completeness theorems for these logics are proved, the full first-order theory is proved to be hereditary undecidable and the satisfiability problem of the quantifier-free fragment is proved to be NP-complete. (shrink)

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree (...) below $\emptyset'$ but not in general. We also answer the analogs of two well-known questions about the stable Ramsey's theorem by showing that our weaker principle does not imply COH or WKL 0 in the context of reverse mathematics. (shrink)

Drawing on the puzzling behavior of ordinary knowledge ascriptions that embed an epistemic (im)possibility claim, we tentatively conclude that it is untenable to jointly endorse (i) an unfettered classical logic for epistemic language, (ii) the general veridicality of knowledge ascription, and (iii) an intuitive ‘negative transparency’ thesis that reduces knowledge of a simple negated ‘might’ claim to an epistemic claim without modal content. We motivate a strategic trade-off: preserve veridicality and (generalized) negative transparency, while abandoning the general validity of contraposition. (...) We criticize various approaches to incorporating veridicality into domain semantics, a paradigmatic ‘information-sensitive’ framework for capturing negative transparency and, more generally, the non-classical behavior of sentences with epistemic modals. We then present a novel information-sensitive semantics that successfully executes our favored strategy: stable acceptance semantics, extending a vanilla bilateral state-based semantics for epistemic modals with a knowledge operator loosely inspired by the defeasibility theory of knowledge. (shrink)

Gelfond and Lifschitz proposed the notion of a stable model of a logic program. We establish that the set of all stable models in a Herbrand universe of a recursive logic program is, up to recursive renaming, the set of all infinite paths of a recursive, countably branching tree, and conversely. As a consequence, the problem, given a recursive logic program, of determining whether it has at least one stable model, is Σ11-complete. Due to the equivalences established (...) in the authors' previous nonmonotone rule systems papers ), this applies equally to truth maintenance systems and default logics. (shrink)

We solve two problems from a work of Haskel and Pillay concerning maximal stable quotients of groups ∧-definable in NIP theories. The first result says that if G is a ∧-definable group in a distal theory, then Gst=G00 (where Gst is the smallest ∧-definable subgroup with G∕Gst stable, and G00 is the smallest ∧-definable subgroup of bounded index). In order to get it, we prove that distality is preserved under passing from T to the hyperimaginary expansion Theq. The (...) second result is an example of a group G definable in a nondistal NIP theory for which G=G00, but Gst is not an intersection of definable groups. Our example is a saturated extension of (R,+,[0,1]). Moreover, we make some observations on the question whether there is such an example which is a group of finite exponent. We also take the opportunity and give several characterizations of stability of hyperdefinable sets involving continuous logic. (shrink)

Action Languages are formal methods of talking about actions and their effects on fluents. One recent approach in planning is to define the domains of the planning problems using action languages. The aim of this research is to find a plan for a system defined in the action language C by translating it into a causal theory and then finding an equivalent logic program. The planning problem will then be reduced to finding the answer set (stable model) of this (...) logic program. This planner will be added as an extension to the Causal Calculator (CCALC) which is a model checker for the language of the causal theories. (shrink)

Mechanisms to ensure the integrity of the system stable evolutionary strategy Homo sapiens – genetic and cultural coevolution techno-cultural balance – are analyzed. оe main content of the study can be summarized in the following the- ses: stable adaptive strategy of Homo sapiens includes superposition of three basic types (biological, cultural and technological) of adaptations, the integrity of the system provides by two coevolutionary ligament its elements – the genetic-cultural coevolution and techno-cultural balance, the system takes as result (...) of by develop- ment of genetic and information technologies by advent of genetic and informa- tion technologies extremely unstable conūguration; a harbinger of a radical change in the mechanisms of global evolution religion is a consequence of structural and functional organization of the human psyche; it played (along with science and technology) the role of socio-cultural adaptation of the human mind are present a number of ideas or concepts (the idea of God, including) the genesis of that ideas is associated with the interaction of two information systems, that appear to each other as information substrates – emotional, and verbal-logical (discursive) forms; evolution of the mentality has two nodes, that corresponding to the dominance of rationalism or religion in spiritual culture; the problem of rational justiūcation of religion in modern science is presented by two alternative methodologies – evo- lutionary epistemological and metaphysical-ontological ones; both methodologies are incompatible in a logical perspective; in the evolutionary epistemological im- pact concept of religion and science are equal and alternative building blocks of a stable evolutionary strategy of Homo sapiens, and their balance sheet pro. (shrink)

Hrushovski originated the study of “flat” stable structures in constructing a new strongly minimal set and a stable 0-categorical pseudoplane. We exhibit a set of axioms which for collections of finite structure with dimension function δ give rise to stable generic models. In addition to the Hrushovski examples, this formalization includes Baldwin's almost strongly minimal non-Desarguesian projective plane and several others. We develop the new case where finite sets may have infinite closures with respect to the dimension (...) function δ. In particular, the generic structure need not be ω-saturated and so the argument for stability is significantly more complicated. We further show that these structures are “flat” and do not interpret a group. (shrink)

We prove that a theory T has stable forking if and only if Teq has stable forking.

Fisher [10] and Baur [6] showed independently in the seventies that if T is a complete first-order theory extending the theory of modules, then the class of models of T with pure embeddings is stable. In [25, 2.12], it is asked if the same is true for any abstract elementary class $(K, \leq _p)$ such that K is a class of modules and $\leq _p$ is the pure submodule relation. In this paper we give some instances where this is (...) true:Theorem.Assume R is an associative ring with unity. Let $(K, \leq _p)$ be an AEC such that $K \subseteq R\text {-Mod}$ and K is closed under finite direct sums, then: •If K is closed under pure-injective envelopes, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda \geq \operatorname {LS}(\mathbf {K})$ such that $\lambda ^{|R| + \aleph _0}= \lambda $.•If K is closed under pure submodules and pure epimorphic images, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda $ such that $\lambda ^{|R| + \aleph _0}= \lambda $.•Assume R is Von Neumann regular. If $\mathbf {K}$ is closed under submodules and has arbitrarily large models, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda $ such that $\lambda ^{|R| + \aleph _0}= \lambda $.As an application of these results we give new characterizations of noetherian rings, pure-semisimple rings, Dedekind domains, and fields via superstability. Moreover, we show how these results can be used to show a link between being good in the stability hierarchy and being good in the axiomatizability hierarchy.Another application is the existence of universal models with respect to pure embeddings in several classes of modules. Among them, the class of flat modules and the class of $\mathfrak {s}$ -torsion modules. (shrink)

It is shown that a stable division ring with positive characteristic has finite dimension over its centre. This is then extended to simple division rings.

We give some general criteria for the stable embeddedness of a definable set. We use these criteria to establish the stable embeddedness in algebraically closed valued fields of two definable sets: The set of balls of a given radius r < 1 contained in the valuation ring and the set of balls of a given multiplicative radius r < 1. We also show that in an algebraically closed valued field a 0-definable set is stably embedded if and only (...) if its algebraic closure is stably embedded. (shrink)

We prove that if T is a stable theory with only a finite number of countable models, then T contains a type-definable pseudoplane. We also show that for any stable theory T either T contains a type-definable pseudoplane or T is weakly normal.

We give an account of stable reasoning, a recent and novel approach to problem solving from a formal, logical point of view. We describe the underlying logic of stable reasoning and illustrate how it is used to model different domains and solve practical reasoning problems. We discuss some of the main differences with respect to reasoning in classical logic and we examine an ongoing research programme for the rational reconstruction of human knowledge that may be considered a successor (...) to the logical empiricists’ programme of the mid-twentieth century. (shrink)

We provide a general framework for studying the expansion of strongly minimal sets by adding additional relations in the style of Hrushovski. We introduce a notion of separation of quantifiers which is a condition on the class of expansions of finitely generated models for the expanded theory to have a countable ω-saturated model. We apply these results to construct for each sufficiently fast growing finite-to-one function μ from 'primitive extensions' to the natural numbers a theory T μ of an expansion (...) of an algebraically closed field which has Morley rank 2. Finally, we show that if μ is not finite-to-one the theory may not be ω-stable. (shrink)

A maximal almost disjoint (mad) family $\mathscr{A} \subseteq [\omega]^\omega$ is Cohen-stable if and only if it remains maximal in any Cohen generic extension. Otherwise it is Cohen-unstable. It is shown that a mad family, A, is Cohen-unstable if and only if there is a bijection G from ω to the rationals such that the sets G[A], A ∈A are nowhere dense. An ℵ 0 -mad family, A, is a mad family with the property that given any countable family $\mathscr{B} (...) \subset [\omega]^\omega$ such that each element of B meets infinitely many elements of A in an infinite set there is an element of A meeting each element of B in an infinite set. It is shown that Cohen-stable mad families exist if and only if there exist ℵ 0 -mad families. Either of the conditions b = c or $\mathfrak{a} ) implies that there exist Cohen-stable mad families. Similar results are obtained for splitting families. For example, a splitting family, S, is Cohen-unstable if and only if there is a bijection G from ω to the rationals such that the boundaries of the sets G[S], S ∈S are nowhere dense. Also, Cohen-stable splitting families of cardinality ≤ κ exist if and only if ℵ 0 -splitting families of cardinality ≤ κ exist. (shrink)

Vopenka [2] proved long ago that every set of ordinals is set-generic over HOD, Gödel's inner model of hereditarily ordinal-definable sets. Here we show that the entire universe V is class-generic over, and indeed over the even smaller inner model $\mathbb{S}=$, where S is the Stability predicate. We refer to the inner model $\mathbb{S}$ as the Stable Core of V. The predicate S has a simple definition which is more absolute than any definition of HOD; in particular, it is (...) possible to add reals which are not set-generic but preserve the Stable Core. (shrink)

We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.

We define an $\mathfrak{R}$-group to be a stable group with the property that a generic element can only be algebraic over a generic. We then derive some corollaries for $\mathfrak{R}$-groups and fields, and prove a decomposition theorem and a field theorem. As a nonsuperstable example, we prove that small stable groups are $\mathfrak{R}$-groups.

For a NIP theory T, a sufficiently saturated model ${\mathfrak C}$ of T, and an invariant (over some small subset of ${\mathfrak C}$ ) global type p, we prove that there exists a finest relatively type-definable over a small set of parameters from ${\mathfrak C}$ equivalence relation on the set of realizations of p which has stable quotient. This is a counterpart for equivalence relations of the main result of [2] on the existence of maximal stable quotients of (...) type-definable groups in NIP theories. Our proof adapts the ideas of the proof of this result, working with relatively type-definable subsets of the group of automorphisms of the monster model as defined in [3]. (shrink)

We define an R-group to be a stable group with the property that a generic element (for any definable transitive group action) can only be algebraic over a generic. We then derive some corollaries for R-groups and fields, and prove a decomposition theorem and a field theorem. As a nonsuperstable example, we prove that small stable groups are R-groups.

Our eyes, bodies, and perspectives are constantly shifting as we observe the world. Despite this, we are very good at distinguishing between self-caused visual changes and changes in the environment: the world appears mostly stable despite our visual field moving around. This, it seems, also occurs when we are dreaming. As we visually investigate the dream environment, we track moving objects with our dream eyes, examine objects, and shift focus. These movements, research suggests, are reflected in the rapid movements (...) or saccades of our sleeping eyes. Do we really see the dream world in the same way that we see the real world? If we do, how could dreaming, usually assumed to be mind-generated hallucinations, replicate such an experience? This problem would be deflated if dreams are not hallucinations at all, but rather imagination, illusion or simply unrealistic. I argue that imagination and illusion views do not satisfactorily explain away the problem of vision and action in sleep. The imagination model is not a complete description of dreaming that is consistent with empirical research, and it is unlikely that the visual dream world is an illusion. Given that the dreaming visual experience is most likely active, hallucinatory, and at times a realistic world simulation, there are important implications for our understanding of visual perception and its relationship to movement. Evidence suggests that our dream eyes investigate the dream world as our waking eyes investigate the waking world. If changes to the unconsciously generated dream environment are perceived as external and unintentional while dream body movements are perceived as self-generated and intentional, current theory of visual perception may have to be expanded to account for how the dreaming mind generates a stable world in which we track and visually explore mind-generated objects. (shrink)

We show that an infinite field is interpretable in a stable torsion-free nilpotent groupG of classk, k>1. Furthermore we prove thatG/Z k-1 (G) must be divisible. By generalising methods of Belegradek we classify some stable torsion-free nilpotent groups modulo isomorphism and elementary equivalence.

We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of U þ -rank 1 must arise from definable stable sets.

An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the ϕ-definitions of p as ϕ ranges through all stable formulae. A necessary condition for stably definability is given and used to produce an example of a supersimple theory with stable forking having types that are not stably definable. This answers negatively a question posed in [8]. A criterion for and example of a stably (...) definable amalgamation base whose restriction to the canonical base is not axiomatised by stable formulae are also given. The examples involve generic relations over non CM-trivial stable theories. (shrink)

The projective plane of Baldwin 695) is model complete in a language with additional constant symbols. The infinite rank bicolored field of Poizat 1339) is not model complete. The finite rank bicolored fields of Baldwin and Holland 371; Notre Dame J. Formal Logic , to appear) are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the strongly minimal set is ‘well-behaved’ (...) and admits ‘exactly rank k formulas’. The last notion is a geometric condition on strongly minimal sets formalized in this paper. (shrink)

On y montre qu'un corps stable de caractéristique positive est de dimension finie sur son centre, puis on généralise la chose aux corps simples.

We develop the theory of domination by stable types and stable weight in an arbitrary theory.

A countable, atomically stable structure U in a finite, relational language has fewer than 2 ω non-isomorphic substructures if and only if U is cellular. An example shows that the finiteness of the language is necessary.

This doctoral dissertation investigates the notion of physical necessity. Specifically, it studies whether it is possible to account for non-accidental regularities without the standard assumption of a pre-existent set of governing laws. Thus, it takes side with the so called deflationist accounts of laws of nature, like the humean or the antirealist. The specific aim is to complement such accounts by providing a missing explanation of the appearance of physical necessity. In order to provide an explanation, I recur to fields (...) that have not been appealed to so far in discussions about the metaphysics of laws. Namely, I recur to complex systems’ theory, and to the foundations of statistical mechanics. The explanation proposed is inspired by how complex systems’ theory has elucidated the way patterns emerge, and by the probabilistic explanations of the 2nd law of thermodynamics. More specifically, this thesis studies how some constraints that make no direct reference to the dynamics can be a sufficient condition for obtaining in the long run, with high probability, stable regular behavior. I hope to show how certain metaphysical accounts of laws might benefit from the insights achieved in these other fields. According to the proposal studied in this thesis, some regularities are not accidental not in virtue of an underlying physical necessity. The non-accidental character of certain regular behavior is only due to its overwhelming stability. Thus, from this point of view the goal becomes to explain the stability of temporal patterns without assuming a set of pre-existent guiding laws. It is argued that the stability can be the result of a process of convergence to simpler and stable regularities from a more complex lower level. According to this project, if successful, there would be no need to postulate a (mysterious) intermediate category between logical necessity and pure contingency. Similarly, there would be no need to postulate a (mysterious) set of pre-existent governing laws. Part I of the thesis motivates part II, mostly by arguing why further explanation of the notions of physical necessity and governing laws should be welcomed (chapter 1), and by studying the plausibility of a lawless fundamental level (chapters 2 and 3). Given so, part II develops the explanation of formation of simpler and stable behavior from a more complex underlying level. (shrink)

We generalize tools and results from first order stable theories to groups inside a simple stable strongly homogeneous model.

The family of all stable models for a logic program has a surprisingly simple overall structure, once two naturally occurring orderings are made explicit. In a so-called knowledge ordering based on degree of definedness, every logic program P has a smallest stable model, sk P — it is the well-founded model. There is also a dual largest stable model, S k P, which has not been considered before. There is another ordering based on degree of truth. Taking (...) the meet and the join, in the truth ordering, of the two extreme stable models sk P and S.. (shrink)