Switch to: References

Citations of:

Set Theory

Journal of Symbolic Logic 46 (4):876-877 (1981)

Add citations

You must login to add citations.
  1. The monadic theory of ω2.Yuri Gurevich, Menachem Magidor & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (2):387-398.
    Assume ZFC + "There is a weakly compact cardinal" is consistent. Then: (i) For every $S \subseteq \omega, \mathrm{ZFC} +$ "S and the monadic theory of ω 2 are recursive each in the other" is consistent; and (ii) ZFC + "The full second-order theory of ω 2 is interpretable in the monadic theory of ω 2 " is consistent.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • PCF structures of height less than ω 3.Karim Er-Rhaimini & Boban Veličković - 2010 - Journal of Symbolic Logic 75 (4):1231-1248.
    We show that it is relatively consistent with ZFC to have PCF structures of heightδ, for all ordinalsδ<ω3.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logic in the 1930s: Type Theory and Model Theory.Georg Schiemer & Erich H. Reck - 2013 - Bulletin of Symbolic Logic 19 (4):433-472.
    In historical discussions of twentieth-century logic, it is typically assumed that model theory emerged within the tradition that adopted first-order logic as the standard framework. Work within the type-theoretic tradition, in the style ofPrincipia Mathematica, tends to be downplayed or ignored in this connection. Indeed, the shift from type theory to first-order logic is sometimes seen as involving a radical break that first made possible the rise of modern model theory. While comparing several early attempts to develop the semantics of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Toward a stability theory of tame abstract elementary classes.Sebastien Vasey - 2018 - Journal of Mathematical Logic 18 (2):1850009.
    We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also present an (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Finitist set theory in ontological modeling.Avril Styrman & Aapo Halko - 2018 - Applied ontology 13 (2):107-133.
    This article introduces finitist set theory (FST) and shows how it can be applied in modeling finite nested structures. Mereology is a straightforward foundation for transitive chains of part-whole relations between individuals but is incapable of modeling antitransitive chains. Traditional set theories are capable of modeling transitive and antitransitive chains of relations, but due to their function as foundations of mathematics they come with features that make them unnecessarily difficult in modeling finite structures. FST has been designed to function as (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (Probably) Not companions in guilt.Sharon Berry - 2018 - Philosophical Studies 175 (9):2285-2308.
    In this paper, I will attempt to develop and defend a common form of intuitive resistance to the companions in guilt argument. I will argue that one can reasonably believe there are promising solutions to the access problem for mathematical realism that don’t translate to moral realism. In particular, I will suggest that the structuralist project of accounting for mathematical knowledge in terms of some form of logical knowledge offers significant hope of success while no analogous approach offers such hope (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • What Are Structural Properties?†.Johannes Korbmacher & Georg Schiemer - 2018 - Philosophia Mathematica 26 (3):295-323.
    Informally, structural properties of mathematical objects are usually characterized in one of two ways: either as properties expressible purely in terms of the primitive relations of mathematical theories, or as the properties that hold of all structurally similar mathematical objects. We present two formal explications corresponding to these two informal characterizations of structural properties. Based on this, we discuss the relation between the two explications. As will be shown, the two characterizations do not determine the same class of mathematical properties. (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • A microscopic approach to Souslin-tree constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Laver Indestructibility and the Class of Compact Cardinals.Arthur W. Apter - 1998 - Journal of Symbolic Logic 63 (1):149-157.
    Using an idea developed in joint work with Shelah, we show how to redefine Laver's notion of forcing making a supercompact cardinal $\kappa$ indestructible under $\kappa$-directed closed forcing to give a new proof of the Kimchi-Magidor Theorem in which every compact cardinal in the universe satisfies certain indestructibility properties. Specifically, we show that if K is the class of supercompact cardinals in the ground model, then it is possible to force and construct a generic extension in which the only strongly (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Logic in the Tractatus.Max Weiss - 2017 - Review of Symbolic Logic 10 (1):1-50.
    I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Ordinals and graph decompositions.Stephen Flood - 2017 - Annals of Pure and Applied Logic 168 (4):824-839.
    Download  
     
    Export citation  
     
    Bookmark  
  • Fusion and large cardinal preservation.Sy-David Friedman, Radek Honzik & Lyubomyr Zdomskyy - 2013 - Annals of Pure and Applied Logic 164 (12):1247-1273.
    In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ but also preserves the strength of κ. This provides a general theory covering the known cases of tree iterations which preserve large cardinals [3], Friedman and Halilović [5], Friedman and Honzik [6], Friedman and Magidor [8], Friedman and Zdomskyy [10], Honzik [12]).
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Maximality Principles in Set Theory.Luca Incurvati - 2017 - Philosophia Mathematica 25 (2):159-193.
    In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Richness and Reflection.Neil Barton - 2016 - Philosophia Mathematica 24 (3):330-359.
    A pervasive thought in contemporary philosophy of mathematics is that in order to justify reflection principles, one must hold universism: the view that there is a single universe of pure sets. I challenge this kind of reasoning by contrasting universism with a Zermelian form of multiversism. I argue that if extant justifications of reflection principles using notions of richness are acceptable for the universist, then the Zermelian can use similar justifications. However, I note that for some forms of richness argument, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The club principle and the distributivity number.Heike Mildenberger - 2011 - Journal of Symbolic Logic 76 (1):34 - 46.
    We give an affirmative answer to Brendle's and Hrušák's question of whether the club principle together with h > N₁ is consistent. We work with a class of axiom A forcings with countable conditions such that q ≥ n p is determined by finitely many elements in the conditions p and q and that all strengthenings of a condition are subsets, and replace many names by actual sets. There are two types of technique: one for tree-like forcings and one for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Magidor function and diamond.Pierre Matet - 2011 - Journal of Symbolic Logic 76 (2):405 - 417.
    Let κ be a regular uncountable cardinal and λ be a cardinal greater than κ. We show that if 2 <κ ≤ M(κ, λ), then ◇ κ,λ holds, where M(κ, λ) equals $\lambda ^{\aleph }0$ if cf(λ) ≥ κ, and $(\lambda ^{+})^{\aleph _{0}}$ otherwise.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Second order logic or set theory?Jouko Väänänen - 2012 - Bulletin of Symbolic Logic 18 (1):91-121.
    We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A hierarchy of tree-automatic structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
    We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The tree property at ℵ ω+1.Dima Sinapova - 2012 - Journal of Symbolic Logic 77 (1):279-290.
    We show that given ω many supercompact cardinals, there is a generic extension in which there are no Aronszajn trees at ℵω+1. This is an improvement of the large cardinal assumptions. The previous hypothesis was a huge cardinal and ω many supercompact cardinals above it, in Magidor—Shelah [7].
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • How applied mathematics became pure.Penelope Maddy - 2008 - Review of Symbolic Logic 1 (1):16-41.
    My goal here is to explore the relationship between pure and applied mathematics and then, eventually, to draw a few morals for both. In particular, I hope to show that this relationship has not been static, that the historical rise of pure mathematics has coincided with a gradual shift in our understanding of how mathematics works in application to the world. In some circles today, it is held that historical developments of this sort simply represent changes in fashion, or in (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Splitting number at uncountable cardinals.Jindřich Zapletal - 1997 - Journal of Symbolic Logic 62 (1):35-42.
    We study a generalization of the splitting number s to uncountable cardinals. We prove that $\mathfrak{s}(\kappa) > \kappa^+$ for a regular uncountable cardinal κ implies the existence of inner models with measurables of high Mitchell order. We prove that the assumption $\mathfrak{s}(\aleph_\omega) > \aleph_{\omega + 1}$ has a considerable large cardinal strength as well.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Abstract logic and set theory. II. large cardinals.Jouko Väänänen - 1982 - Journal of Symbolic Logic 47 (2):335-346.
    The following problem is studied: How large and how small can the Löwenheim and Hanf numbers of unbounded logics be in relation to the most common large cardinals? The main result is that the Löwenheim number of the logic with the Härtig-quantifier can be consistently put in between any two of the first weakly inaccessible, the first weakly Mahlo, the first weakly compact, the first Ramsey, the first measurable and the first supercompact cardinals.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
    We show that one can solve Post's Problem by constructing generic sets in the usual set theoretic framework applied to tiny universes. This method leads to a new class of recursively enumerable sets: r.e. generic sets. All r.e. generic sets are low and simple and therefore of Turing degree strictly between 0 and 0'. Further they supply the first example of a class of low recursively enumerable sets which are automorphic in the lattice E of recursively enumerable sets with inclusion. (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • On the existence of large p-ideals.Winfried Just, A. R. D. Mathias, Karel Prikry & Petr Simon - 1990 - Journal of Symbolic Logic 55 (2):457-465.
    We prove the existence of p-ideals that are nonmeagre subsets of P(ω) under various set-theoretic assumptions.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The equivalence of determinacy and iterated sharps.Derrick Albert Dubose - 1990 - Journal of Symbolic Logic 55 (2):502-525.
    We characterize, in terms of determinacy, the existence of 0 ♯♯ as well as the existence of each of the following: 0 ♯♯♯ , 0 ♯♯♯♯ ,0 ♯♯♯♯♯ , .... For k ∈ ω, we define two classes of sets, (k * Σ 0 1 ) * and (k * Σ 0 1 ) * + , which lie strictly between $\bigcup_{\beta and Δ(ω 2 -Π 1 1 ). We also define 0 1♯ as 0 ♯ and in general, 0 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The topological Vaught's conjecture and minimal counterexamples.Howard Becker - 1994 - Journal of Symbolic Logic 59 (3):757-784.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Standard foundations for nonstandard analysis.David Ballard & Karel Hrbacek - 1992 - Journal of Symbolic Logic 57 (2):741-748.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Connections between axioms of set theory and basic theorems of universal algebra.H. Andréka, Á Kurucz & I. Németi - 1994 - Journal of Symbolic Logic 59 (3):912-923.
    One of the basic theorems in universal algebra is Birkhoff's variety theorem: the smallest equationally axiomatizable class containing a class K of algebras coincides with the class obtained by taking homomorphic images of subalgebras of direct products of elements of K. G. Gratzer asked whether the variety theorem is equivalent to the Axiom of Choice. In 1980, two of the present authors proved that Birkhoff's theorem can already be derived in ZF. Surprisingly, the Axiom of Foundation plays a crucial role (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On the Consistency of the Definable Tree Property on $\aleph_1$.Amir Leshem - 2000 - Journal of Symbolic Logic 65 (3):1204-1214.
    In this paper we prove the equiconsistency of "Every $\omega_1$-tree which is first order definable over has a cofinal branch" with the existence of a $\Pi^1_1$ reflecting cardinal. We also prove that the addition of MA to the definable tree property increases the consistency strength to that of a weakly compact cardinal. Finally we comment on the generalization to higher cardinals.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Two Applications Of Inner Model Theory To The Study Of \sigma^1_2 Sets.Greg Hjorth - 1996 - Bulletin of Symbolic Logic 2 (1):94-107.
    §0. Preface. There has been an expectation that the endgame of the more tenacious problems raised by the Los Angeles ‘cabal’ school of descriptive set theory in the 1970's should ultimately be played out with the use of inner model theory. Questions phrased in the language of descriptive set theory, where both the conclusions and the assumptions are couched in terms that only mention simply definable sets of reals, and which have proved resistant to purely descriptive set theoretic arguments, may (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Precipitous Towers of Normal Filters.Douglas R. Burke - 1997 - Journal of Symbolic Logic 62 (3):741-754.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • After All, There are Some Inequalities which are Provable in ZFC.Tomek Bartoszyński, Andrzej Rosłanowski & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (2):803-816.
    We address ZFC inequalities between some cardinal invariants of the continuum, which turned out to be true in spite of strong expectations given by [11].
    Download  
     
    Export citation  
     
    Bookmark  
  • The Axiom of Infinity and Transformations j: V → V.Paul Corazza - 2010 - Bulletin of Symbolic Logic 16 (1):37-84.
    We suggest a new approach for addressing the problem of establishing an axiomatic foundation for large cardinals. An axiom asserting the existence of a large cardinal can naturally be viewed as a strong Axiom of Infinity. However, it has not been clear on the basis of our knowledge of ω itself, or of generally agreed upon intuitions about the true nature of the mathematical universe, what the right strengthening of the Axiom of Infinity is—which large cardinals ought to be derivable? (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Woodin for strong compactness cardinals.Stamatis Dimopoulos - 2019 - Journal of Symbolic Logic 84 (1):301-319.
    Download  
     
    Export citation  
     
    Bookmark  
  • Basis theorems for -sets.Chi Tat Chong, Liuzhen Wu & Liang Yu - 2019 - Journal of Symbolic Logic 84 (1):376-387.
    Download  
     
    Export citation  
     
    Bookmark  
  • Extending the Non-extendible: Shades of Infinity in Large Cardinals and Forcing Theories.Stathis Livadas - 2018 - Axiomathes 28 (5):565-586.
    This is an article whose intended scope is to deal with the question of infinity in formal mathematics, mainly in the context of the theory of large cardinals as it has developed over time since Cantor’s introduction of the theory of transfinite numbers in the late nineteenth century. A special focus has been given to this theory’s interrelation with the forcing theory, introduced by P. Cohen in his lectures of 1963 and further extended and deepened since then, which leads to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Recognizable sets and Woodin cardinals: computation beyond the constructible universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Aronszajn trees, square principles, and stationary reflection.Chris Lambie-Hanson - 2017 - Mathematical Logic Quarterly 63 (3-4):265-281.
    We investigate questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of introduced by Brodsky and Rinot for the purpose of constructing κ‐Souslin trees. Answering a question of Rinot, we prove that the weaker of these strengthenings is compatible with stationary reflection at κ but the stronger is not. We then prove that, if μ is a singular cardinal, implies the existence of a special ‐tree with a cf(μ)‐ascent path, thus answering a question of Lücke.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Sets of reals.Joan Bagaria & W. Hugh Woodin - 1997 - Journal of Symbolic Logic 62 (4):1379-1428.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Woodin's axiom , bounded forcing axioms, and precipitous ideals on ω 1.Benjamin Claverie & Ralf Schindler - 2012 - Journal of Symbolic Logic 77 (2):475-498.
    If the Bounded Proper Forcing Axiom BPFA holds, then Mouse Reflection holds at N₂ with respect to all mouse operators up to the level of Woodin cardinals in the next ZFC-model. This yields that if Woodin's ℙ max axiom (*) holds, then BPFA implies that V is closed under the "Woodin-in-the-next-ZFC-model" operator. We also discuss stronger Mouse Reflection principles which we show to follow from strengthenings of BPFA, and we discuss the theory BPFA plus "NS ω1 is precipitous" and strengthenings (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Satisfaction relations for proper classes: Applications in logic and set theory.Robert A. Van Wesep - 2013 - Journal of Symbolic Logic 78 (2):345-368.
    We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate ($\models^*$) appropriate to such structures. We indicate the utility of this theory as a framework for the development of the metatheory of first-order predicate logic and set theory, and we use it to prove that for any recursively enumerable extension $\Theta$ of ZF there is a finitely axiomatizable extension $\Theta'$ of GB that is a conservative extension of $\Theta$. We also (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rado's conjecture and presaturation of the nonstationary ideal on ω1.Qi Feng - 1999 - Journal of Symbolic Logic 64 (1):38-44.
    We prove that Rado's Conjecture implies that the nonstationary ideal on ω 1 is presaturated.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Forcing and Consistency Results for Recursion in3E Together with Selection Over ℵ1.M. R. R. Hoole - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (7-9):107-115.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sets and supersets.Toby Meadows - 2016 - Synthese 193 (6):1875-1907.
    It is a commonplace of set theory to say that there is no set of all well-orderings nor a set of all sets. We are implored to accept this due to the threat of paradox and the ensuing descent into unintelligibility. In the absence of promising alternatives, we tend to take up a conservative stance and tow the line: there is no universe. In this paper, I am going to challenge this claim by taking seriously the idea that we can (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Foundations as truths which organize mathematics.Colin Mclarty - 2013 - Review of Symbolic Logic 6 (1):76-86.
    The article looks briefly at Fefermans own foundations. Among many different senses of foundations, the one that mathematics needs in practice is a recognized body of truths adequate to organize definitions and proofs. Finding concise principles of this kind has been a huge achievement by mathematicians and logicians. We put ZFC and categorical foundations both into this context.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Modeling occurrences of objects in relations.Joop Leo - 2010 - Review of Symbolic Logic 3 (1):145-174.
    We study the logical structure of relations, and in particular the notion of occurrences of objects in a state. We start with formulating a number of principles for occurrences and defining corresponding mathematical models. These models are analyzed to get more insight in the formal properties of occurrences. In particular, we prove uniqueness results that tell us more about the possible logical structures relations might have.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Descriptive inner model theory.Grigor Sargsyan - 2013 - Bulletin of Symbolic Logic 19 (1):1-55.
    The purpose of this paper is to outline some recent progress in descriptive inner model theory, a branch of set theory which studies descriptive set theoretic and inner model theoretic objects using tools from both areas. There are several interlaced problems that lie on the border of these two areas of set theory, but one that has been rather central for almost two decades is the conjecture known as the Mouse Set Conjecture. One particular motivation for resolving MSC is that (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • 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 definable. (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Universal sets for pointsets properly on the n th level of the projective hierarchy.Greg Hjorth, Leigh Humphries & Arnold W. Miller - 2013 - Journal of Symbolic Logic 78 (1):237-244.
    The Axiom of Projective Determinacy implies the existence of a universal $\utilde{\Pi}^{1}_{n}\setminus\utilde{\Delta}^{1}_{n}$ set for every $n \geq 1$. Assuming $\text{\upshape MA}(\aleph_{1})+\aleph_{1}=\aleph_{1}^{\mathbb{L}}$ there exists a universal $\utilde{\Pi}^{1}_{1}\setminus\utilde{\Delta}^{1}_{1}$ set. In ZFC there is a universal $\utilde{\Pi}^{0}_{\alpha}\setminus\utilde{\Delta}^{0}_{\alpha}$ set for every $\alpha$.
    Download  
     
    Export citation  
     
    Bookmark  
  • Foundations of nominal techniques: logic and semantics of variables in abstract syntax.Murdoch J. Gabbay - 2011 - Bulletin of Symbolic Logic 17 (2):161-229.
    We are used to the idea that computers operate on numbers, yet another kind of data is equally important: the syntax of formal languages, with variables, binding, and alpha-equivalence. The original application of nominal techniques, and the one with greatest prominence in this paper, is to reasoning on formal syntax with variables and binding. Variables can be modelled in many ways: for instance as numbers (since we usually take countably many of them); as links (since they may `point' to a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations