Search results for 'Graph theory' (try it on Scholar)

1000+ found
Order:
  1.  9
    William Gasarch & Jeffry L. Hirst (1998). Reverse Mathematics and Recursive Graph Theory. Mathematical Logic Quarterly 44 (4):465-473.
    We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  2.  8
    Sahotra Sarkar (1990). On Adaptation: A Reduction of the Kauffman-Levin Model to a Problem in Graph Theory and its Consequences. [REVIEW] Biology and Philosophy 5 (2):127-148.
    It is shown that complex adaptations are best modelled as discrete processes represented on directed weighted graphs. Such a representation captures the idea that problems of adaptation in evolutionary biology are problems in a discrete space, something that the conventional representations using continuous adaptive landscapes does not. Further, this representation allows the utilization of well-known algorithms for the computation of several biologically interesting results such as the accessibility of one allele from another by a specified number of point mutations, the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  3.  4
    John M. Harris, Jeffry L. Hirst & Michael J. Mossinghoff (2008). Combinatorics and Graph Theory. Springer.
    This book covers a wide variety of topics in combinatorics and graph theory.
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  4.  12
    Marcel Weber, On the Incompatibility of Dynamical Biological Mechanisms and Causal Graph Theory.
    I examine the adequacy of the causal graph-structural equations approach to causation for modeling biological mechanisms. I focus in particular on mechanisms with complex dynamics such as the PER biological clock mechanism in Drosophila. I show that a quantitative model of this mechanism that uses coupled differential equations – the well-known Goldbeter model – cannot be adequately represented in the standard causal graph framework, even though this framework does permit causal cycles. The reason is that the model contains (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5. Harvey Friedman, P01 INCOMPLETENESS: Finite Graph Theory.
    For digraphs G, we write V(G) for the set of all vertices of G, and E(G) for the set of all edges of G. A digraph on a set E is a digraph G where V(G) = E.
    No categories
     
    Export citation  
     
    My bibliography  
  6.  9
    Adam Synowiecki, Krzysztof Kiwiel & John Dickson (1973). Hegel's Logic in the Light of Graph Theory. Dialectics and Humanism 1 (1):87-96.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  7. Harvey M. Friedman, Applications of Large Cardinals to Graph Theory.
    Since then we have been engaged in the development of such results of greater relevance to mathematical practice. In January, 1997 we presented some new results of this kind involving what we call “jump free” classes of finite functions. This Jump Free Theorem is treated in section 2.
    Translate
     
     
    Export citation  
     
    My bibliography  
  8.  1
    Harald Gropp (1996). Poincaré and Graph Theory. Philosophia Scientiae 1 (4):85-95.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  9. Edward Maziarz (1979). Graph Theory: 1736-1936 by N. L. Biggs; E. K. Lloyd; R. J. Wilson. [REVIEW] Isis: A Journal of the History of Science 70:164-165.
    Direct download  
     
    Export citation  
     
    My bibliography  
  10.  22
    Benjamin D. Miller (2012). The Graph-Theoretic Approach to Descriptive Set Theory. Bulletin of Symbolic Logic 18 (4):554-575.
    We sketch the ideas behind the use of chromatic numbers in establishing descriptive set-theoretic dichotomy theorems.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  11. Z. Diskin (1997). Towards Algebraic Graph-Based Model Theory for Computer Science. Bulletin of Symbolic Logic 3:144-145.
     
    Export citation  
     
    My bibliography  
  12. Rafael de Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661-672.
    Recently, several authors have claimed to have found graph-theoretic counterexamples to the Principle of the Identity of Indiscernibles. In this paper, I argue that their counterexamples presuppose a certain view of what unlabeled graphs are, and that this view is optional at best.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  13.  8
    Stephan Kornmesser (2016). A Frame-Based Approach for Theoretical Concepts. Synthese 193 (1):145-166.
    According to a seminal paper by Barsalou , frames are attribute-value-matrices for representing exemplars or concepts. Frames have been used as a tool for reconstructing scientific concepts as well as conceptual change within scientific revolutions . In the frame-based representations of scientific concepts developed so far the semantic content of concepts is determined by a set of attribute-specific values. This way of representing semantic content works best for prototype concepts and defined concepts of a conceptual taxonomy satisfying the no-overlap principle. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14.  25
    Alexander Gebharter & Marie I. Kaiser (2014). Causal Graphs and Biological Mechanisms. In Marie I. Kaiser, Oliver Scholz, Daniel Plenge & Andreas Hüttemann (eds.), Explanation in the special sciences: The case of biology and history. Springer 55-85.
    Modeling mechanisms is central to the biological sciences – for purposes of explanation, prediction, extrapolation, and manipulation. A closer look at the philosophical literature reveals that mechanisms are predominantly modeled in a purely qualitative way. That is, mechanistic models are conceived of as representing how certain entities and activities are spatially and temporally organized so that they bring about the behavior of the mechanism in question. Although this adequately characterizes how mechanisms are represented in biology textbooks, contemporary biological research practice (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15.  3
    Thomas M. Gruenenfelder, Gabriel Recchia, Tim Rubin & Michael N. Jones (2015). Graph‐Theoretic Properties of Networks Based on Word Association Norms: Implications for Models of Lexical Semantic Memory. Cognitive Science 40 (1):n/a-n/a.
    We compared the ability of three different contextual models of lexical semantic memory and of a simple associative model to predict the properties of semantic networks derived from word association norms. None of the semantic models were able to accurately predict all of the network properties. All three contextual models over-predicted clustering in the norms, whereas the associative model under-predicted clustering. Only a hybrid model that assumed that some of the responses were based on a contextual model and others on (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  16.  9
    Frederik Herzberg (2014). A Graded Bayesian Coherence Notion. Erkenntnis 79 (4):843-869.
    Coherence is a key concept in many accounts of epistemic justification within ‘traditional’ analytic epistemology. Within formal epistemology, too, there is a substantial body of research on coherence measures. However, there has been surprisingly little interaction between the two bodies of literature. The reason is that the existing formal literature on coherence measure operates with a notion of belief system that is very different from—what we argue is—a natural Bayesian formalisation of the concept of belief system from traditional epistemology. Therefore, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  17. Stephen F. Bush & Sanjay Goel (forthcoming). Graph Spectra for Communications in Biological and Carbon Nanotube Networks. Ieee Journal on Selected Areas in Communications:1--10.
    No categories
     
    Export citation  
     
    My bibliography  
  18. Gerard Ellis (1995). Conceptual Structures Applications, Implementation and Theory : Third International Conference on Conceptual Structures, Iccs '95, Santa Cruz, Ca, Usa, August 14-18, 1995 : Proceedings'. [REVIEW]
    No categories
     
    Export citation  
     
    My bibliography  
  19.  8
    Miriam Backens & Ali Nabi Duman (2016). A Complete Graphical Calculus for Spekkens’ Toy Bit Theory. Foundations of Physics 46 (1):70-103.
    While quantum theory cannot be described by a local hidden variable model, it is nevertheless possible to construct such models that exhibit features commonly associated with quantum mechanics. These models are also used to explore the question of \-ontic versus \-epistemic theories for quantum mechanics. Spekkens’ toy theory is one such model. It arises from classical probabilistic mechanics via a limit on the knowledge an observer may have about the state of a system. The toy theory for (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  5
    Jean A. Larson (2005). Ramsey Theory for Countable Binary Homogeneous Structures. Notre Dame Journal of Formal Logic 46 (3):335-352.
    Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  21.  36
    Matthias Dehmer & Abbe Mowshowitz (2011). Generalized Graph Entropies. Complexity 17 (2):45-50.
  22.  31
    Régis Pellissier (2008). “Setting” N-Opposition. Logica Universalis 2 (2):235-263.
    Our aim is to show that translating the modal graphs of Moretti’s “n-opposition theory” (2004) into set theory by a suited device, through identifying logical modal formulas with appropriate subsets of a characteristic set, one can, in a constructive and exhaustive way, by means of a simple recurring combinatory, exhibit all so-called “logical bi-simplexes of dimension n” (or n-oppositional figures, that is the logical squares, logical hexagons, logical cubes, etc.) contained in the logic produced by any given modal (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  23. Landon Rabern, Brian Rabern & Matthew Macauley (2013). Dangerous Reference Graphs and Semantic Paradoxes. Journal of Philosophical Logic 42 (5):727-765.
    The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  24. Nicholas Shackel (2011). The World as a Graph: Defending Metaphysical Graphical Structuralism. Analysis 71 (1):10-21.
    Metaphysical graphical structuralism is the view that at some fundamental level the world is a mathematical graph of nodes and edges. Randall Dipert has advanced a graphical structuralist theory of fundamental particulars and Alexander Bird has advanced a graphical structuralist theory of fundamental properties. David Oderberg has posed a powerful challenge to graphical structuralism: that it entails the absurd inexistence of the world or the absurd cessation of all change. In this paper I defend graphical (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography  
  25. Joseph Berger (2000). Theory and Formalization: Some Reflections on Experience. Sociological Theory 18 (3):482-489.
    I describe in this paper some of my efforts in developing formal theories of social processes. These include work on models of occupational mobility, on models to describe the emergence of expectations out of performance evaluations, and on the graph theory formulation of the Status Characteristics theory. Not all models have been equally significant in developing theory. However, the graph theory formulation has played a central role in the growth of the Expectation States program. (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  42
    Matthew Tugby (2013). Categoricalism, Dispositionalism, and the Epistemology of Properties. Synthese 191 (6):1-16.
    Notoriously, the dispositional view of natural properties is thought to face a number of regress problems, one of which points to an epistemological worry. In this paper, I argue that the rival categorical view is also susceptible to the same kind of regress problem. This problem can be overcome, most plausibly, with the development of a structuralist epistemology. After identifying problems faced by alternative solutions, I sketch the main features of this structuralist epistemological approach, referring to graph-theoretic modelling in (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27.  7
    Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti & Alessandro Tosini (2015). Free Quantum Field Theory From Quantum Cellular Automata. Foundations of Physics 45 (10):1137-1152.
    After leading to a new axiomatic derivation of quantum theory, the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles, the automata theory is quantum ab-initio, and does not assume Lorentz covariance (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  7
    Vera Koponen & Tapani Hyttinen (2015). On Compactness of Logics That Can Express Properties of Symmetry or Connectivity. Studia Logica 103 (1):1-20.
    A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29.  9
    Jeffrey Kline & Shravan Luckraz (2011). A Note on the Relationship Between Graphs and Information Protocols. Synthese 179 (S1):103-114.
    Information protocols (IP's) were developed to describe players who learn their social situation by their experiences. Although IP's look similar to colored multi-graphs (MG's), the two objects are constructed in fundamentally different ways. IP's are constructed using the global concept of history, whereas graphs are constructed using the local concept of edges. We give necessary and sufficient conditions for each theory to be captured by the other. We find that the necessary and sufficient condition for IP theory to (...)
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  30.  1
    Matthew Jura, Oscar Levin & Tyler Markkanen (2014). Domatic Partitions of Computable Graphs. Archive for Mathematical Logic 53 (1-2):137-155.
    Given a graph G, we say that a subset D of the vertex set V is a dominating set if it is near all the vertices, in that every vertex outside of D is adjacent to a vertex in D. A domatic k-partition of G is a partition of V into k dominating sets. In this paper, we will consider issues of computability related to domatic partitions of computable graphs. Our investigation will center on answering two types of questions (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  31.  16
    Ming Hsiung (2009). Jump Liars and Jourdain's Card Via the Relativized T-Scheme. Studia Logica 91 (2):239 - 271.
    A relativized version of Tarski’s T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain’s card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n , the n -jump liar sentence is (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  32.  9
    Paul Shafer (2012). Menger's Theorem in {{\ Pi^ 11\ Tt {-CA} 0}}. Archive for Mathematical Logic 51 (3-4):407-423.
    We prove Menger’s theorem for countable graphs in ${{\Pi^1_1\tt{-CA}_0}}$ . Our proof in fact proves a stronger statement, which we call extended Menger’s theorem, that is equivalent to ${{\Pi^1_1\tt{-CA}_0}}$ over ${{\tt{RCA}_0}}$.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  33.  19
    Adam Kolany (2010). Reversed Resolution in Reducing General Satisfiability Problem. Studia Logica 95 (3):407 - 416.
    In the following we show that general property S considered by Cowen [1], Cowen and Kolany in [3] and earlier by Cowen in [2] and Kolany in [4] as hypergraph satisfiability, can be constructively reduced to (3, 2) · SAT , that is to satisfiability of (at most) triples with two-element forbidden sets. This is an analogue of the“classical” result on the reduction of SAT to 3 · SAT.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  34. Thomas C. Brown (1979). Canonical Simplification of Finite Objects, Well Quasi-Ordered by Tree Embedding. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
     
    Export citation  
     
    My bibliography  
  35. X. Chen & G. M. Megson (1993). A Methodology of Partitioning and Mapping for Given Regular Arrays with Lower Dimension. University of Newcastle Upon Tyne, Computing Science.
    No categories
     
    Export citation  
     
    My bibliography  
  36. Peter W. Eklund, Gerard Ellis & Graham Mann (1996). Conceptual Structures Knowledge Representation as Interlingua : 4th International Conference on Conceptual Structures, Iccs '96, Sydney, Australia, August 19-22, 1996 : Proceedings'. [REVIEW]
    No categories
     
    Export citation  
     
    My bibliography  
  37. L. Zager & G. Verghese (2009). Epidemic Thresholds for Infections in Uncertain Networks. Complexity 14 (4):12-25.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  38. Itamar Pitowsky, Quantum Mechanics as a Theory of Probability.
    We develop and defend the thesis that the Hilbert space formalism of quantum mechanics is a new theory of probability. The theory, like its classical counterpart, consists of an algebra of events, and the probability measures defined on it. The construction proceeds in the following steps: (a) Axioms for the algebra of events are introduced following Birkhoff and von Neumann. All axioms, except the one that expresses the uncertainty principle, are shared with the classical event space. The only (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  39.  8
    Pieter Hofstra & Michael A. Warren (2013). Combinatorial Realizability Models of Type Theory. Annals of Pure and Applied Logic 164 (10):957-988.
    We introduce a new model construction for Martin-Löf intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines, by gluing along the functor from the category of contexts to the category of groupoids, the syntactic model with a notion of realizability. As our main application, we use the model to analyse the syntactic groupoid associated to the type theory generated by a graph G, showing that it has (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  40. Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon (2005). Enumerations in Computable Structure Theory. Annals of Pure and Applied Logic 136 (3):219-246.
    We exploit properties of certain directed graphs, obtained from the families of sets with special effective enumeration properties, to generalize several results in computable model theory to higher levels of the hyperarithmetical hierarchy. Families of sets with such enumeration features were previously built by Selivanov, Goncharov, and Wehner. For a computable successor ordinal α, we transform a countable directed graph into a structure such that has a isomorphic copy if and only if has a computable isomorphic copy.A computable (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  41.  13
    Haiyan Xu, Keith W. Hipel, D. Marc Kilgour & Ye Chen (2010). Combining Strength and Uncertainty for Preferences in the Graph Model for Conflict Resolution with Multiple Decision Makers. Theory and Decision 69 (4):497-521.
    A hybrid preference framework is proposed for strategic conflict analysis to integrate preference strength and preference uncertainty into the paradigm of the graph model for conflict resolution (GMCR) under multiple decision makers. This structure offers decision makers a more flexible mechanism for preference expression, which can include strong or mild preference of one state or scenario over another, as well as equal preference. In addition, preference between two states can be uncertain. The result is a preference framework that (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  42.  15
    Osamu Katai, Katsushi Minamizono, Takayuki Shiose & Hiroshi Kawakami (2007). System Design of “Ba”-Like Stages for Improvisational Acts Via Leibnizian Space–Time and Peirce's Existential Graph Concepts. AI and Society 22 (2):101-112.
    A framework for “improvisational” social acts and communication is introduced by referring to the idea of “relationalism” such as natural farming, permaculture and deep ecology. Based on this conception, the notion of Existential Graph by C. S. Peirce is introduced. The notion of extended self in deep ecology is substantiated based on the Roy Adaptation Model in Nursing Theory and Narrative approaches. By focusing on Leibnizian notions of space and time and by introducing Petri net, a spatio-temporal model (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  43.  23
    Michael O'Rourke (2011). The Afterlives of Queer Theory. Continent 1 (2):102-116.
    continent. 1.2 (2011): 102-116. All experience open to the future is prepared or prepares itself to welcome the monstrous arrivant, to welcome it, that is, to accord hospitality to that which is absolutely foreign or strange [….] All of history has shown that each time an event has been produced, for example in philosophy or in poetry, it took the form of the unacceptable, or even of the intolerable, or the incomprehensible, that is, of a certain monstrosity. Jacques Derrida “Passages—from (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  44.  5
    J. W. Addison (2004). Tarski's Theory of Definability: Common Themes in Descriptive Set Theory, Recursive Function Theory, Classical Pure Logic, and Finite-Universe Logic. 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 pure logic, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  45.  4
    Matthew Jura (2016). Reverse Mathematics and the Coloring Number of Graphs. Notre Dame Journal of Formal Logic 57 (1):27-44.
    We use methods of reverse mathematics to analyze the proof theoretic strength of a theorem involving the notion of coloring number. Classically, the coloring number of a graph $G=$ is the least cardinal $\kappa$ such that there is a well-ordering of $V$ for which below any vertex in $V$ there are fewer than $\kappa$ many vertices connected to it by $E$. We will study a theorem due to Komjáth and Milner, stating that if a graph is the union (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46.  9
    Dao-Zhi Zeng, Liping Fang, Keith W. Hipel & D. Marc Kilgour (2004). Policy Stable States in the Graph Model for Conflict Resolution. Theory and Decision 57 (4):345-365.
    A new approach to policy analysis is formulated within the framework of the graph model for conflict resolution. A policy is defined as a plan of action for a decision maker (DM) that specifies the DM’s intended action starting at every possible state in a graph model of a conflict. Given a profile of policies, a Policy Stable State (PSS) is a state that no DM moves away from (according to its policy), and such that no DM would (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  47.  9
    Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
    In this paper the existence or nonexistence of isomorphic mappings between graph models for the untyped lambda calculus is studied. It is shown that Engeler's D A is completely determined, up to isomorphism, by the cardinality of its `atom-set' A. A similar characterization is given for a collection of graph models of the Pω-type; from this some propositions regarding automorphisms are obtained. Also we give an indication of the complexity of the first-order theory of graph models (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  48.  5
    Gregor Betz (2005). The Vicious Circle Theorem – a Graph-Theoretical Analysis of Dialectical Structures. Argumentation 19 (1):53-64.
    This article sets up a graph-theoretical framework for argumentation-analysis (dialectical analysis) which expands classical argument-analysis. Within this framework, a main theorem on the existence of inconsistencies in debates is stated and proved: the vicious circle theorem. Subsequently, two corollaries which generalize the main theorem are derived. Finally, a brief outlook is given on further expansions and possible applications of the developed framework.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  49.  2
    Laurence Kirby (2013). Ordinal Operations on Graph Representations of Sets. Mathematical Logic Quarterly 59 (1):19-26.
    Any set x is uniquely specified by the graph of the membership relation on the set obtained by adjoining x to the transitive closure of x. Thus any operation on sets can be looked at as an operation on these graphs. We look at the operations of ordinal arithmetic of sets in this light. This turns out to be simplest for a modified ordinal arithmetic based on the Zermelo ordinals, instead of the usual von Neumann ordinals. In this arithmetic, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  50.  13
    Elliott Wagner (2009). Communication and Structured Correlation. Erkenntnis 71 (3):377 - 393.
    Philosophers and social scientists have recently turned to Lewis sender–receiver games to provide an account of how lexical terms can acquire meaning through an evolutionary process. However, the evolution of meaning is contingent on both the particular sender–receiver game played and the choice of evolutionary dynamic. In this paper I explore some differences between models that presume an infinitely large and randomly mixed population and models in which a finite number of agents communicate with their neighbors in a social network. (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
1 — 50 / 1000