Results for ' definability theory'

966 found
Order:
  1.  29
    Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.
  2.  47
    Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
  3.  98
    Some contributions to definability theory for languages with generalized quantifiers.John T. Baldwin & Douglas E. Miller - 1982 - Journal of Symbolic Logic 47 (3):572-586.
  4.  35
    Generalizations of gödel’s incompleteness theorems for ∑ N-definable theories of arithmetic.Makoto Kikuchi & Taishi Kurahashi - 2017 - Review of Symbolic Logic 10 (4):603-616.
    It is well known that Gödel’s incompleteness theorems hold for ∑1-definable theories containing Peano arithmetic. We generalize Gödel’s incompleteness theorems for arithmetically definable theories. First, we prove that every ∑n+1-definable ∑n-sound theory is incomplete. Secondly, we generalize and improve Jeroslow and Hájek’s results. That is, we prove that every consistent theory having ∏n+1set of theorems has a true but unprovable ∏nsentence. Lastly, we prove that no ∑n+1-definable ∑n-sound theory can prove its own ∑n-soundness. These three results are (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  31
    Remark to “local definability theory” of Reyes.S. Shelah - 1971 - Annals of Mathematical Logic 2 (4):441-447.
  6.  27
    Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.
  7.  29
    Gödel’s second incompleteness theorem for Σn-definable theories.Conden Chao & Payam Seraji - 2018 - Logic Journal of the IGPL 26 (2):255-257.
  8.  31
    On Defining the Hamiltonian Beyond Quantum Theory.Dominic Branford, Oscar C. O. Dahlsten & Andrew J. P. Garner - 2018 - Foundations of Physics 48 (8):982-1006.
    Energy is a crucial concept within classical and quantum physics. An essential tool to quantify energy is the Hamiltonian. Here, we consider how to define a Hamiltonian in general probabilistic theories—a framework in which quantum theory is a special case. We list desiderata which the definition should meet. For 3-dimensional systems, we provide a fully-defined recipe which satisfies these desiderata. We discuss the higher dimensional case where some freedom of choice is left remaining. We apply the definition to example (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  9. An Institution-independent Proof of the Beth Definability Theorem.M. Aiguier & F. Barbier - 2007 - Studia Logica 85 (3):333-359.
    A few results generalizing well-known classical model theory ones have been obtained in institution theory these last two decades (e.g. Craig interpolation, ultraproduct, elementary diagrams). In this paper, we propose a generalized institution-independent version of the Beth definability theorem.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  19
    Definability of Sets in Models of Axiomatic Theories.A. Grzegorczyk, A. Mostowski & C. Ryll-Nardzewski - 1969 - Journal of Symbolic Logic 34 (1):126-126.
  11.  61
    An isomorphism between monoids of external embeddings: About definability in arithmetic.Mihai Prunescu - 2002 - Journal of Symbolic Logic 67 (2):598-620.
    We use a new version of the Definability Theorem of Beth in order to unify classical theorems of Yuri Matiyasevich and Jan Denef in one structural statement. We give similar forms for other important definability results from Arithmetic and Number Theory.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  12.  9
    A hierarchy of Turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability.R. G. Downey - 2020 - Princeton: Princeton University Press. Edited by Noam Greenberg.
    This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  24
    (1 other version)Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory.J. Richard Büchi† & Steven Senger - 1988 - Mathematical Logic Quarterly 34 (4):337-342.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  44
    Barwise Jon. Admissible sets and structures. An approach to definability theory. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, and New York, 1975, XIV + 394 pp. [REVIEW]Mark Nadel - 1978 - Journal of Symbolic Logic 43 (1):139-144.
  15. Defining a crisis: the roles of principles in the search for a theory of quantum gravity.Karen Crowther - 2021 - Synthese 198 (Suppl 14):3489-3516.
    In times of crisis, when current theories are revealed as inadequate to task, and new physics is thought to be required—physics turns to re-evaluate its principles, and to seek new ones. This paper explores the various types, and roles of principles that feature in the problem of quantum gravity as a current crisis in physics. I illustrate the diversity of the principles being appealed to, and show that principles serve in a variety of roles in all stages of the crisis, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  16. Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
    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 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  17.  73
    Neuroethics: Defining the Issues in Theory, Practice, and Policy.Judy Illes (ed.) - 2005 - Oxford University Press.
    Recent advances in the brain sciences have dramatically improved our understanding of brain function. As we find out more and more about what makes us tick, we must stop and consider the ethical implications of this new found knowledge. This ground-breaking book on the emerging field of neuroethics answers many pertinent questions, such as: What makes monitoring and manipulating the human brain so ethically challenging? Will having a new biology of the brain through imaging make us less responsible for our (...)
    Direct download  
     
    Export citation  
     
    Bookmark   29 citations  
  18.  41
    (1 other version)Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
    We continue the study of simple theories begun in [3] and [5]. We first find the right analogue of definability of types. We then develop the theory of generic types and stabilizers for groups definable in simple theories. The general ideology is that the role of formulas (or definability) in stable theories is replaced by partial types (or ∞-definability) in simple theories.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19.  76
    The Theory of ‘Belonging’: Defining concepts used within Belonging, Being and Becoming—The Australian Early Years Learning Framework.Chris Peers & Marilyn Fleer - 2014 - Educational Philosophy and Theory 46 (8):914-928.
    The implementation in 2009–10 of the Early Years Learning Framework (EYLF) spearheaded the efforts of the Australian Commonwealth government to institute a national curriculum. The theme of the new early childhood framework follows three guiding concepts: Belonging, Being and Becoming. In this article, we discuss these three concepts in order to provide a theoretical context to the Early Years Learning Framework and to enrich the debate surrounding its writing and implementation. In particular, we address the significance of posing Belonging in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20. Defining Environmental Justice: Theories, Movements, and Nature: Theories, Movements, and Nature.David Schlosberg - 2007 - Oxford University Press.
    The book uses both environmental movements and political theory to help define what is meant by environmental and ecological justice. It will be attractive to anyone interested in environmental politics, environmental movements, and justice theory.
    Direct download  
     
    Export citation  
     
    Bookmark   22 citations  
  21.  71
    Definability in low simple theories.Ziv Shami - 2000 - Journal of Symbolic Logic 65 (4):1481-1490.
  22. From Defining Art to Defining the Individual Arts: The Role of Theory in the Philosophies of Arts.Aaron Meskin - 2008 - In Kathleen Stock & Katherine Thomson-Jones, New waves in aesthetics. New York: Palgrave-Macmillan. pp. 125--149.
     
    Export citation  
     
    Bookmark   10 citations  
  23.  67
    Mutual definability does not imply definitional equivalence, a simple example.Hajnal Andréka, Judit X. Madarász & István Németi - 2005 - Mathematical Logic Quarterly 51 (6):591-597.
    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.
    Direct download  
     
    Export citation  
     
    Bookmark   25 citations  
  24.  44
    Defining ecology: Ecological theories, mathematical models, and applied biology in the 1960s and 1970s.Paolo Palladino - 1991 - Journal of the History of Biology 24 (2):223 - 243.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  25. Resplendent models and Σ11{\Sigma_1^1} -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  10
    Recursion theory: computational aspects of definability.C. -T. Chong - 2015 - Boston: Walter de Gruyter GmbH & Co., KG. Edited by Liang Yu.
    The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  51
    Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.
    Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  28.  39
    Defining art culturally : modern theories of art - a synthesis.Simon Fokt - 2012 - Dissertation, University of St. Andrews
    Numerous theories have attempted to overcome the anti-essentialist scepticism about the possibility of defining art. While significant advances have been made in this field, it seems that most modern definitions fail to successfully address the issue of the ever-changing nature of art raised by Morris Weitz, and rarely even attempt to provide an account which would be valid in more than just the modern Western context. This thesis looks at the most successful definitions currently defended, determines their strengths and weaknesses, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  29.  45
    Expansions of the real field by open sets: definability versus interpretability.Harvey Friedman, Krzysztof Kurdyka, Chris Miller & Patrick Speissegger - 2010 - Journal of Symbolic Logic 75 (4):1311-1325.
    An open U ⊆ ℝ is produced such that (ℝ, +, ·, U) defines a Borel isomorph of (ℝ, +, ·, ℕ) but does not define ℕ. It follows that (ℝ, +, ·, U) defines sets in every level of the projective hierarchy but does not define all projective sets. This result is elaborated in various ways that involve geometric measure theory and working over o-minimal expansions of (ℝ, +, ·). In particular, there is a Cantor set E ⊆ (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  30.  16
    Definable and invariant types in enrichments of nip theories.Silvain Rideau & Pierre Simon - 2017 - Journal of Symbolic Logic 82 (1):317-324.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31. Relative truth definability of axiomatic truth theories.Kentaro Fujimoto - 2010 - Bulletin of Symbolic Logic 16 (3):305-344.
    The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overview of recent developments of axiomatic theories of truth in the light of it. We also show several new proof-theoretic results via relative truth definability including a complete answer to the conjecture raised by Feferman in [13].
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  32.  18
    The definable -theorem for distal theories.Gareth Boxall & Charlotte Kestner - 2018 - Journal of Symbolic Logic 83 (1):123-127.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  58
    On the Boolean algebras of definable sets in weakly o‐minimal theories.Stefano Leonesi & Carlo Toffalori - 2004 - Mathematical Logic Quarterly 50 (3):241-248.
    We consider the sets definable in the countable models of a weakly o-minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic , in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  60
    Defining Death in Theory and Practice.James L. Bernat, Charles M. Culver & Bernard Gert - 1982 - Hastings Center Report 12 (1):5-9.
  35.  61
    Algebraicity and Implicit Definability in Set Theory.Joel David Hamkins & Cole Leahy - 2016 - Notre Dame Journal of Formal Logic 57 (3):431-439.
    We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets; that is, $\mathrm{HOA}=\mathrm{HOD}$. Moreover, we show that every algebraic model of $\mathrm{ZF}$ is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp—an algebraic analogue of the constructible universe—which is obtained by iteratively adding (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36.  62
    Definability in the monadic second-order theory of successor.J. Richard Buchi & Lawrence H. Landweber - 1969 - Journal of Symbolic Logic 34 (2):166 - 170.
    Let be a relational system whereby D is a nonempty set and P1 is an m1-ary relation on D. With we associate the (weak) monadic second-order theory consisting of the first-order predicate calculus with individual variables ranging over D; monadic predicate variables ranging over (finite) subsets of D; monadic predicate quantifiers; and constants corresponding to P1, P2, …. We will often use ambiguously to mean also the set of true sentences of.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  37.  6
    Defining Rationality in Security Studies: Expected Utility, Theory-Driven Reasoning, and the Vietnam War.Jeffrey A. Friedman - 2024 - Critical Review: A Journal of Politics and Society 36 (4):526-540.
    In How States Think, John Mearsheimer and Sebastian Rosato argue that expected-utility maximization is too subjective to serve as the basis for making rational decisions in the realm of national security. They claim that rationality in security studies should instead be defined by whether leaders conduct deliberative, theory-driven reasoning. This essay explains why Mearsheimer and Rosato’s critique of expected-utility theory is unpersuasive, and how their conception of theory-driven reasoning ignores key aspects of decision-making that national security officials (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  16
    Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory.J. Büchi & Steven Senger - 1988 - Mathematical Logic Quarterly 34 (4):337-342.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  53
    Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory.Robert E. Byerly - 1984 - Mathematical Logic Quarterly 30 (32-34):499-503.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  14
    (1 other version)Intersecting Compositional and Transactional Theory: How Art Can Help Define Reader Response.Nina R. Schoonover - 2020 - Journal of Aesthetic Education 54 (1):90-100.
    The writer starts with vision and ends with words. The reader, however, starts with the writer’s words and ends with vision.Reading comprehension is like an eye. It requires focus and concentration on how a mode is interpreted. Eyes are shaped by cultures; a Western norm considers it polite to hold one’s gaze and maintain eye contact when dialoguing, while other cultures find it aggressive or confrontational. Similarly, reading is culturally shaped through the lens of the reader, as interpretation is correlated (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  41
    On forking and definability of types in some dp-minimal theories.Pierre Simon & Sergei Starchenko - 2014 - Journal of Symbolic Logic 79 (4):1020-1024.
    We prove in particular that, in a large class of dp-minimal theories including the p-adics, definable types are dense amongst nonforking types.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  42.  57
    Definability and quantifier elimination for j3-theories.Ítala M. L. D'Ottaviano - 1987 - Studia Logica 46 (1):37 - 54.
    The Joint Non-Trivialization Theorem, two Definability Theorems and the generalized Quantifier Elimination Theorem are proved for J 3-theories. These theories are three-valued with more than one distinguished truth-value, reflect certain aspects of model type logics and can. be paraconsistent. J 3-theories were introduced in the author's doctoral dissertation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43. Defining Trust and E-trust: Old Theories and New Problems.Mariarosaria Taddeo - 2009 - International Journal of Technology and Human Interaction (IJTHI) Official Publication of the Information Resources Management Association 5 (2):23-35.
    The paper provides a selective analysis of the main theories of trust and e-trust (that is, trust in digital environments) provided in the last twenty years, with the goal of preparing the ground for a new philosophical approach to solve the problems facing them. It is divided into two parts. The first part is functional toward the analysis of e-trust: it focuses on trust and its definition and foundation and describes the general background on which the analysis of e-trust rests. (...)
     
    Export citation  
     
    Bookmark   24 citations  
  44.  96
    A theory of causality: Causality=interaction (as defined by a suitable quantum field theory). [REVIEW]Adrian Heathcote - 1989 - Erkenntnis 31 (1):77 - 108.
    In this paper I put forward a suggestion for identifying causality in micro-systems with the specific quantum field theoretic interactions that occur in such systems. I first argue — along the lines of general transference theories — that such a physicalistic account is essential to an understanding of causation; I then proceed to sketch the concept of interaction as it occurs in quantum field theory and I do so from both a formal and an informal point of view. Finally, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  45.  6
    Contribution to the Theory of Definable Sets and Functions.A. Mostowski - 1960 - Journal of Symbolic Logic 25 (4):365-365.
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  47
    Ehrenfeucht’s Lemma in Set Theory.Gunter Fuchs, Victoria Gitman & Joel David Hamkins - 2018 - Notre Dame Journal of Formal Logic 59 (3):355-370.
    Ehrenfeucht’s lemma asserts that whenever one element of a model of Peano arithmetic is definable from another, they satisfy different types. We consider here the analogue of Ehrenfeucht’s lemma for models of set theory. The original argument applies directly to the ordinal-definable elements of any model of set theory, and, in particular, Ehrenfeucht’s lemma holds fully for models of set theory satisfying V=HOD. We show that the lemma fails in the forcing extension of the universe by adding (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  47.  48
    Definability in models of set theory.David Guaspari - 1980 - Journal of Symbolic Logic 45 (1):9-19.
  48.  16
    Axiomatization and Forcing in Set Theory with Urelements.Bokai Yao - forthcoming - Journal of Symbolic Logic.
    In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms specifically concerning urelements. We prove that these axioms form a hierarchy over $\text {ZFCU}_{\text {R}}$ (ZFC with urelements formulated with Replacement) in terms of direct implication. The second part of the paper studies forcing over countable transitive models of $\text {ZFU}_{\text {R}}$. We propose a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  47
    A theory of finite many-output automata defined by matrices.Jerzy Nowak - 1969 - Studia Logica 24 (1):55 - 81.
  50. A definable continuous rank for nonmultidimensional superstable theories.Ambar Chowdhury, James Loveys & Predrag Tanovic - 1996 - Journal of Symbolic Logic 61 (3):967-984.
1 — 50 / 966