It is shown that the classes of Routley-Meyer models which are axiomatizable by a theory in a propositional relevant language with fusion and the Ackermann constant can be characterized by their closure under certain model-theoretic operations involving prime filter extensions, relevant directed bisimulations and disjoint unions.

Abstract.Since the gene splicing debates of the 1980s, the public has been exposed to an ongoing sequence of genetic and reproductive technologies. Many issue areas have outcomes that lose track of people's inner values or engender opposing religious viewpoints defying final resolution. This essay relocates the discussion of what is an acceptable application from the individual to the societal level, examining technologies that stand to address large numbers of people and thus call for policy resolution, rather than individual fiat, in (...) their application. A major source of guidance is the “Genetic Frontiers” series of professional dialogues and conferences held by the National Conference for Community and Justice from 2002 to 2004. Genetic testing, human gene therapy, genetic engineering of plants and animals, and stem cell technology are examined. While differences in perspective on the beginning of life persist, a stepwise approach to the examination of genetic testing reveals areas of general agreement. Stewardship of life, human co‐creativity with the divine, and social justice help define the bounds of application of genetic engineering and therapy; compassionate care plays a major role in establishing stem cell policy. Active, sustained dialogue is a useful resource for enabling sharing of religious values and crystallization of policies. (shrink)

In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model N without parameters in a model M, we show that N is isomorphic to M if M is elementary extension of the standard model and N is elementarily equivalent to M. On the other hand, we show that there is a model M and a definable model N with parameters in M such that N (...) is elementarily equivalent to M but N is not isomorphic to M. We also show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M, and N is isomorphic to M, but N is not definably isomorphic to M. And also, we give a generalization of Tennenbaum's theorem. At the end, we give a new method to construct a definable model by a refinement of Kotlarski's method. (shrink)

We consider expansions of models of Peano arithmetic to models ofA 2 s -¦Δ 1 1 +Σ 1 1 −AC which consist of families of sets definable by nonstandard formulas.

What role does “discursive consciousness” play in decision-making? How does it interact with “practical consciousness?” These two questions constitute two important gaps in strong practice theory that extend from Pierre Bourdieu's habitus to Stephen Vaisey's sociological dual-process model and beyond. The goal of this paper is to provide an empirical framework that expands the sociological dual-process model in order to fill these gaps using models from cognitive neuroscience. In particular, I use models of memory and moral judgment that (...) highlight the importance of executive functions and semantic memory. I outline each model as it pertains to the aforementioned gaps in strong practice theory. I then use the models from cognitive neuroscience to create an expanded dual-process model that addresses how and when conscious mental systems override and interact with subconscious mental systems in the use of cultural ends for decision-making. Finally, using this expanded model I address the sociological debate over the use of interview and survey data. My analysis reveals that surveys and interviews both elicit information encoded in declarative memory and differ primarily in the process of information retrieval that is required of respondents. (shrink)

Ever since the early decades of this century, there have emerged a number of competing schools of ecology that have attempted to weave the concepts underlying natural resource management and natural-historical traditions into a formal theoretical framework. It was widely believed that the discovery of the fundamental mechanisms underlying ecological phenomena would allow ecologists to articulate mathematically rigorous statements whose validity was not predicated on contingent factors. The formulation of such statements would elevate ecology to the standing of a rigorous (...) scientific discipline on a par with physics. However, there was no agreement as to the fundamental units of ecology. Systems ecologists sought to identify the fundamental organization that tied the physical and biological components of ecosystems into an irreducible unit: the ecosystem was their fundamental unit. Population ecologists sought, instead, to identify the biological mechanisms regulating the abundance and distribution of plant and animal species: to these ecologists, the individual organism was the fundamental unit of ecology, and the physical environment was nothing more than a stage upon which the play of individuals in perennial competition took place. As Joel Hagen has pointed out, the two schools were thus dividied by fundamentally different and irreconcilable assumptions about the nature of ecosystems.Notwithstanding these divisive efforts to elevate the image of ecology, the discipline remained in the shadows of American academia until the mid-1960s, when systems ecologists succeeded in projecting ecology onto the national scene. They did so by seeking closer involvement with practical problems: they argued before Congress that their approach to the theoretical problems of ecology was uniquely suited to the solution of the impending “environmental crisis.” With the establishment of the International Biological Program, they succeeded in attracting unprecedented levels of funding for systems ecology research. Theoretical population ecologists, on the other hand, found themselves consigned to the outer regions of this new institutional landscape. The systems ecologists' successful capture of the limelight and the purse brought the divisions between them and population ecologists into sharper relief — hence the hardening of the division of ecology observed by Hagen.45I have argued that the population biologist Richard Levins, prompted by these institutional developments, sought to challenge the social position of systems ecology, and to assert the intellectual priority of theoretical population ecology. He attempted to do so by articulating a nontrivial and rather carefully thought out classification of ecological models that led to the disqualification of systems analysis as a legitimate approach to the study of ecological phenomena. I have suggested that — ultimately —Levins's case against systems analysis in ecology rested on the view that an aspiration to realism and prediction was incompatible with an interest in theoretical issues, a concern that he equated with the search for generality. He sought to reinforce this argument by exploiting the fact that systems ecologists had staked their future on the provision of technical solutions to the problems of the “environmental crisis”: he associated systems ecologists' aspiration to realism and precision with a concern for practical issues, trading on the widely accepted view that practical imperatives are incompatible with the aims of scientific inquiry.46 These are plausible, but nonetheless questionable, claims which have now become an integral part of ecological knowledge. And finally, I hope to have shown how even the most abstract levels of scientific argument are shaped by political considerations, and how discussions of the conceptual development of modern ecology might benefit from a greater consideration of its historical and social dimensions.47. (shrink)

A DO model (here also referred to a Paris model) is a model of set theory all of whose ordinals are first order definable in . Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension T of ZF has a DO model, and (2) for complete extensions T, T has a unique DO model up to isomorphism iff T proves V=OD. Here we provide a comprehensive treatment of Paris (...) models. Our results include the following:1. If T is a consistent completion of ZF+V≠OD, then T has continuum-many countable nonisomorphic Paris models.2. Every countable model of ZFC has a Paris generic extension.3. If there is an uncountable well-founded model of ZFC, then for every infinite cardinal κ there is a Paris model of ZF of cardinality κ which has a nontrivial automorphism.4. For a model ZF, is a prime model ⇒ is a Paris model and satisfies AC⇒ is a minimal model. Moreover, Neither implication reverses assuming Con(ZF). (shrink)

Let R be a binary relation on some domain. Use R∗ for the reflexive transitive closure of R, i.e., the smallest binary relation S with R ⊆ S that is reflexive and transitive. Use R+ for the transitive closure of R, i.e., the smallest binary relation S with R ⊆ S that is transitive. Use I for the identity relation on the domain. Let n range over natural numbers. Define Rn as follows, by induction: R0 := I Rn+1 := R (...) ◦ R.. (shrink)

The Simonton (1991) study of 120 classical composers may provide evidence for the existence of innate talent. A weighted multiplicative model of talent development provides a basis for evaluating the adequacy of Howe et al.'s conclusions.

In this article we find some sufficient and some necessary ${\Sigma^1_1}$ -conditions with oracles for a model to be resplendent or chronically resplendent. The main tool of our proofs is internal arguments, that is analogues of classical theorems and model-theoretic constructions conducted inside a model of first-order Peano Arithmetic: arithmetised back-and-forth constructions and versions of the arithmetised completeness theorem, namely constructions of recursively saturated and resplendent models from the point of view of a model of arithmetic. (...) These internal arguments are used in conjunction with Pabion’s theorem that ensures that certain oracles are coded in a sufficiently saturated model of arithmetic. Examples of applications are provided for the theories of dense linear orders and of discrete linear orders. These results are then generalised to other ω-categorical theories and theories with a unique countable recursively saturated model. (shrink)

There is a model, for a system of intuitionistic analysis including Brouwer's principle for numbers and Kripke's schema, in which math formula ø-definable discrete sets of choice sequences are subcountable.

We carry out a systematic investigation of the definability of linear order on classes of finite rigid structures. We obtain upper and lower bounds for the expressibility of linear order in various logics that have been studied extensively in finite model theory, such as least fixpoint logic LFP, partial fixpoint logic PFP, infinitary logic Lω∞ω with a finite number of variables, as well as the closures of these logics under implicit definitions. Moreover, we show that the upper and (...) lower bounds established here cannot be made substantially tighter, unless outstanding conjectures in complexity theory are resolved at the same time. (shrink)

A pointwise definable model is one in which every object is \loos definable without parameters. In a model of set theory, this property strengthens $V=\HOD$, but is not first-order expressible. Nevertheless, if \ZFC\ is consistent, then there are continuum many pointwise definable models of \ZFC. If there is a transitive model of \ZFC, then there are continuum many pointwise definable transitive models of \ZFC. What is more, every countable model of \ZFC\ has a class forcing extension (...) that is pointwise definable. Indeed, for the main contribution of this article, every countable model of Gödel-Bernays set theory has a pointwise definable extension, in which every set and class is first-order definable without parameters. (shrink)

Although the concept of value is central to sustainable business models (SBMs), the field has struggled to clarify what value is. SBM research accounts for multiple forms of value directed at multiple stakeholders. We argue that this diversity challenge should be addressed not by seeking a field-unifying definition of value but by developing methodological guidelines for a field-specific approach to defining value in SBM contexts. Based on Aristotelian logic and philosophical phenomenology of value, we develop an analytical framework that can (...) be used for generating good definitions of value. We use this framework to explore approaches to value in extant SBM literature, highlight problematic patterns in applications of this concept, and suggest ways to avoid these patterns. The result is a guide to assist SBM researchers in exploring and defining value, and in applying their definitions consistently in theory building efforts. (shrink)

It is possible to understand the expressive power of a logic as issuing from its capacity to express properties of its models. There are some ways to formally capture whether a property of models is expressible, among them is one based on the notion of definability, and one based on the notion of discrimination. If the logics to be compared are defined within the same class of models, one can employ the notions of definability and discrimination directly to (...) obtain formal conditions for relative expressiveness. This paper studies generalizations of these formal conditions to cases where the compared logics are defined within different classes of models. There have been proposed in the literature formal conditions of two main kinds: with forward and with backward model-mappings. It is shown that none of them is adequate, despite their initial reasonableness. Moreover, we argue that general and reasonable formal conditions for relative expressiveness involving forward mappings are not likely to be found, given that they turn out to be highly dependent on specific features of the compared logics. On the other hand, it will be argued that there is a reasonable formal condition involving backward model-mappings. (shrink)

We show that given a finite, transitive and reflexive Kripke model 〈 W , ≼, ⟦ ⋅ ⟧ 〉 and $${w \in W}$$ , the property of being simulated by w (i.e., lying on the image of a literalpreserving relation satisfying the ‘forth’ condition of bisimulation) is modally undefinable within the class of S4 Kripke models. Note the contrast to the fact that lying in the image of w under a bi simulation is definable in the standard modal language (...) even over the class of K4 models, a fairly standard result for which we also provide a proof. We then propose a minor extension of the language adding a sequent operator $${\natural}$$ (‘tangle’) which can be interpreted over Kripke models as well as over topological spaces. Over finite Kripke models it indicates the existence of clusters satisfying a specified set of formulas, very similar to an operator introduced by Dawar and Otto. In the extended language $${{\sf L}^+ = {\sf L}^{\square\natural}}$$ , being simulated by a point on a finite transitive Kripke model becomes definable, both over the class of (arbitrary) Kripke models and over the class of topological S4 models. As a consequence of this we obtain the result that any class of finite, transitive models over finitely many propositional variables which is closed under simulability is also definable in L + , as well as Boolean combinations of these classes. From this it follows that the μ -calculus interpreted over any such class of models is decidable. (shrink)

Knowledge claims are abundant in the literature on large language models (LLMs); but can we say that GPT-4 truly "knows" the Earth is round? To address this question, we review standard definitions of knowledge in epistemology and we formalize interpretations applicable to LLMs. In doing so, we identify inconsistencies and gaps in how current NLP research conceptualizes knowledge with respect to epistemological frameworks. Additionally, we conduct a survey of 100 professional philosophers and computer scientists to compare their preferences in knowledge (...) definitions and their views on whether LLMs can really be said to know. Finally, we suggest evaluation protocols for testing knowledge in accordance to the most relevant definitions. (shrink)

We prove, in ZFC,the existence of a definable, countably saturated elementary extension of the reals.

This paper is devoted to understand groups definable in Presburger Arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded abelian group definable in a model of (Z, +, <) Presburger Arithmetic is definably isomorphic to (Z, +)^n mod out by a lattice.

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of set theory, in which every individual is definable without parameters, challenges this conclusion. In this article, I introduce a flexible new method for constructing pointwise-definable models of arithmetic and set theory, showing furthermore that every countable model of Zermelo-Fraenkel ZF set theory and (...) of Peano arithmetic PA has a pointwise-definable end extension. In the arithmetic case, I use the universal algorithm and its Σ n generalizations to build a progressively elementary tower making any desired individual a n definable at each stage n, while preserving these definitions through to the limit model, which can thus be arranged to be pointwise definable. A similar method works in set theory, and one can moreover achieve V = L in the extension or indeed any other suitable theory holding in an inner model of the original model, thereby fulfilling the resurrection phenomenon. For example, every countable model of ZF with an inner model with a measurable cardinal has an end extension to a pointwise-definable model of ZFC + V = L[μ]. (shrink)

An error has been found in the cited paper; namely, Theorem 3.1 is false.

We give two theories, Th1 and Th2, which are explicitly definable over each other , but are not definitionally equivalent. The languages of the two theories are disjoint.

We study the preservation under projective ccc forcing extensions of the property of L(ℝ) being a Solovay model. We prove that this property is preserved by every strongly-̰Σ₃¹ absolutely-ccc forcing extension, and that this is essentially the optimal preservation result, i.e., it does not hold for Σ₃¹ absolutely-ccc forcing notions. We extend these results to the higher projective classes of ccc posets, and to the class of all projective ccc posets, using definably-Mahlo cardinals. As a consequence we obtain an (...) exact equiconsistency result for generic absoluteness under projective absolutely-ccc forcing notions. (shrink)

A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class. K is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed (...) by the taxonomy. A space X in K is characterized within the classification scheme if whenever Y ∈ K and Y is equivalent to X, then Y is homeomorphic to X. As prime example, the closed set taxonomy assigns to each sentence in the first order language of bounded lattices the class of topological spaces whose lattices of closed sets satisfy that sentence. It turns out that every compact two-complex is characterized via this taxonomy in the class of metrizable spaces, but that no infinite discrete space is so characterized. We investigate various natural classification schemes, compare them, and look into the question of which spaces can and cannot be characterized within them. (shrink)

We study the question of $\mathcal {L}_{\mathrm {ring}}$ -definability of non-trivial henselian valuation rings. Building on previous work of Jahnke and Koenigsmann, we provide a characterization of henselian fields that admit a non-trivial definable henselian valuation. In particular, we treat the cases where the canonical henselian valuation has positive residue characteristic, using techniques from the model theory and algebra of tame fields.

Probabilistic methods are providing new explanatory approaches to fundamental cognitive science questions of how humans structure, process and acquire language. This review examines probabilistic models defined over traditional symbolic structures. Language comprehension and production involve probabilistic inference in such models; and acquisition involves choosing the best model, given innate constraints and linguistic and other input. Probabilistic models can account for the learning and processing of language, while maintaining the sophistication of symbolic models. A recent burgeoning of theoretical developments and (...) online corpus creation has enabled large models to be tested, revealing probabilistic constraints in processing, undermining acquisition arguments based on a perceived poverty of the stimulus, and suggesting fruitful links with probabilistic theories of categorization and ambiguity resolution in perception. (shrink)

We prove that there exists no sentence F of the language of rings with an extra binary predicat I2 satisfying the following property: for every definable set X ⊆ ℂ2, X is connected if and only if ⊧ F, where I2 is interpreted by X. We conjecture that the same result holds for closed subset of ℂ2. We prove some results motivated by this conjecture.

We study connections between asymptotic structure in a Banach space and model theoretic properties of the space. We show that, in an asymptotic sense, a sequence $$ in a Banach space X generates copies of one of the classical sequence spaces $\ell_p$ or $c_0$ inside X if and only if the quantifier-free types approximated by $$ inside X are quantifier-free definable. More precisely, if $$ is a bounded sequence X such that no normalized sequence of blocks of $$ converges, (...) then the following two conditions are equivalent. There exists a sequence $$ of blocks of $$ such that for every finite dimensional subspace E of X, every quantifier-free type over $E +\overline{\rm span}\{y_n\mid n\in \mathbb{N}\}$ is quantifier-free definable. One of the following two conditions holds: there exists $1\le p 0$ and every finite dimensional subspace E of X there exists a sequence of blocks of $$ which is $$-equivalent over E to the standard unit basis of $\ell_p$; for every $\epsilon>0$ and every finite dimensional subspace E of X there exists a sequence of blocks of $$ which is $$-equivalent over E to the standard unit basis of $c_0$. Several byproducts of the proof are analyzed. (shrink)

Many debates in biomedical ethics today involve inconsistencies in defining the key term, person. Both sides of the abortion debate, for instance, beg the question about what constitutes personhood. This book explores the arguments concerning definitions of personhood in the history of modern philosophy, and then constructs a superior model, defined in terms of distinctive features. This model is shown to have distinct advantages over the necessary and sufficient condition models of personhood launched by essentialists. Philosophers historically have (...) been correct about what some of the pivotal distinctive features of personhood are, _e.q._, rationality, communications and self-consciousness, but they have been wrong about the _methods_ of recognizing and asserting personhood, and about the relative importance of feelings. In clinical care, complaints often surface that care is not personal. This book aims to improve care through providing a method of attending to patients as people. Charts in the Appendices show that where physicians attended to personal features important to their patients, sometimes the patients rated the care even higher than the physician did. The book will be useful to health-care providers whose goals include improving quality of care, listening to patients, and preventing malpractice. (shrink)

Background: Compassion has long been advocated as a fundamental element in nursing practice and education. However, defining and translating compassion into caring practice by nursing students who are new to the clinical practice environment as part of their educational journey remain unclear. Objectives: The aim of this study was to explore how Chinese baccalaureate nursing students define and characterize compassionate care as they participate in their clinical practice. Methods: A descriptive qualitative study design was used involving a semi-structured in-depth interview (...) method and qualitative content analysis. Twenty senior year baccalaureate nursing students were interviewed during their clinical practicum experience at four teaching hospitals. Ethical considerations: Permission to conduct the study was received from the Institutional Review Boards and the participating hospitals. Results: Baccalaureate nursing students defined and characterized compassionate care as a union of “empathy” related to a nurse’s desire to “alleviate patients’ suffering,” “address individualized care needs,” “use therapeutic communication,” and “promote mutual benefits with patients.” Students recognized that the “practice environment” was characterized by nurse leaders’ interpersonal relations, role modeling by nurses and workloads which influenced the practice of compassionate care by nursing personnel. Conclusion: Compassionate care is crucial for patients, nurses, and students in their professional development as well as the development of the nursing profession. In order to provide compassionate care, a positive practice environment promoted by hospital administrators is needed. This also includes having an adequate workforce of nurses who can role model compassionate care to students in their preceptor role while meeting the needs of their patients. (shrink)

Assume [Formula: see text]. Let [Formula: see text] be a [Formula: see text] equivalence relation coded in [Formula: see text]. [Formula: see text] has an ordinal definable equivalence class without any ordinal definable elements if and only if [Formula: see text] is unpinned. [Formula: see text] proves [Formula: see text]-class section uniformization when [Formula: see text] is a [Formula: see text] equivalence relation on [Formula: see text] which is pinned in every transitive model of [Formula: see text] containing the (...) real which codes [Formula: see text]: Suppose [Formula: see text] is a relation on [Formula: see text] such that each section [Formula: see text] is an [Formula: see text]-class, then there is a function [Formula: see text] such that for all [Formula: see text], [Formula: see text]. [Formula: see text] proves that [Formula: see text] is Jónsson whenever [Formula: see text] is an ordinal: For every function [Formula: see text], there is an [Formula: see text] with [Formula: see text] in bijection with [Formula: see text] and [Formula: see text]. (shrink)

Causal modelling provides a powerful set of tools for identifying causal structure from observed correlations. It is well known that such techniques fail for quantum systems, unless one introduces 'spooky' hidden mechanisms. Whether one can produce a genuinely quantum framework in order to discover causal structure remains an open question. Here we introduce a new framework for quantum causal modelling that allows for the discovery of causal structure. We define quantum analogues for core features of classical causal modelling techniques, including (...) the causal Markov condition and faithfulness. Based on the process matrix formalism, this framework naturally extends to generalised structures with indefinite causal order. (shrink)

Given a model-complete theory of topological fields, we considered its generic differential expansions and under a certain hypothesis of largeness, we axiomatised the class of existentially closed ones. Here we show that a density result for definable types over definably closed subsets in such differential topological fields. Then we show two transfer results, one on the VC-density and the other one, on the combinatorial property NTP2.

In any nonstandard model of Peano arithmetic, the standard part is not first-order definable. But we show that in some model the standard part is definable as the unique solution of a formula , where P is a unary predicate variable.

In this paper we continue the study of inner models of the type studied inInner models for set theory—Part I.The present paper is concerned exclusively with a particular kind of model, the ‘super-complete models’ defined in section 2.4 of I. The condition of 2.4 and the completeness condition 1.42 imply that such a model is uniquely determined when its universal class Vmis given. Writing condition and the completeness conditions 1.41, 1.42 in terms of Vm, we may state the (...) definition in the form:3.1. Dfn.A classVmis said to determine a super-complete model if the model whose basic notions are defined by,satisfies axiomsA, B, C.N. B. This definition is not necessarily metamathematical in nature. If desired, it could be written out quite formally as the definition of a notion ‘SCM’ thus:whereψ is the propositional function expressing in terms ofUthe fact that the model determined byUaccording to 3.1 satisfies the relativization of axioms A, B, C. E.g. corresponding to axiom A1m, i.e.,,ψ contains the equivalent term. All the relativized axioms can be similarly expressed in this way by first writing out the relativized form and then replacing ‘ϕ bywhich is in turn replaced by, and similarly replacing ‘ϕ’ by ‘ϕ’ by ‘), andThusψ is obtained in primitive notation. (shrink)