Results for ' separability theorems'

1000+ found
Order:
  1.  55
    The separation theorem of intuitionist propositional calculus.Alfred Horn - 1962 - Journal of Symbolic Logic 27 (4):391-399.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  2.  7
    The Separability Theorems.John Broome - 2017 - In Weighing Goods. Oxford, UK: Wiley. pp. 60–89.
    This chapter sets out the theorems, and presents some examples that show in a rough way how the theorems work. It explains separability precisely, and states the theorems. The chapter starts the work of interpreting the theorems, and also explains the significance of their conclusions from a formal, mathematical point of view. It then discusses a significant assumption that is used in the proofs of the theorems. The published proofs of both the separability (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  30
    A separation theorem for discrete-time interval temporal logic.Dimitar P. Guelev & Ben Moszkowski - 2022 - Journal of Applied Non-Classical Logics 32 (1):28-54.
    Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement a...
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  4.  18
    Sheaf recursion and a separation theorem.Nathanael Leedom Ackerman - 2014 - Journal of Symbolic Logic 79 (3):882-907.
    Define a second order tree to be a map between trees. We show that many properties of ordinary trees have analogs for second order trees. In particular, we show that there is a notion of “definition by recursion on a well-founded second order tree” which generalizes “definition by transfinite recursion”. We then use this new notion of definition by recursion to prove an analog of Lusin’s Separation theorem for closure spaces of global sections of a second order tree.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  21
    Two separation theorems for natural deduction.Hugues Leblanc - 1966 - Notre Dame Journal of Formal Logic 7 (2):159-180.
  6.  14
    Relative separation theorems for $\scr L_{\kappa+\kappa}$.Heikki Tuuri - 1992 - Notre Dame Journal of Formal Logic 33 (3):383-401.
  7.  25
    The Separation Theorem for Fragments of the Intuitionistic Propositional Calculus.G. Rousseau - 1970 - Mathematical Logic Quarterly 16 (8):469-474.
  8.  9
    Relative separation theorems for L+.Heikki Tuuri - 1992 - Notre Dame Journal of Formal Logic 33 (3):383-401.
  9.  12
    WKL0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  5
    Alfred Horn. The separation theorem of intuitionist propositional calculus. The journal of symbolic logic, vol. 27 no. 4 , pp. 391–399.T. Thacher Robinson - 1967 - Journal of Symbolic Logic 32 (2):282.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  17
    Algebraic proof of the separation theorem for the infinite-valued logic of Lukasiewicz.Barbara Wozniakowska - 1977 - Bulletin of the Section of Logic 6 (4):186-188.
  12.  10
    WKL< sub> 0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  5
    Review: Alfred Horn, The Separation Theorem of Intuitionist Propositional Calculus. [REVIEW]T. Thacer Robinson - 1967 - Journal of Symbolic Logic 32 (2):282-282.
  14. Review: Tsutomu Hosoi, The Separation Theorem on the Classical System. [REVIEW]T. Thacher Robinson - 1968 - Journal of Symbolic Logic 33 (1):128-128.
     
    Export citation  
     
    Bookmark  
  15.  30
    Tsutomu Hosoi. On the separation theorem of intermediate propositional calculi. Proceedings of the Japan Academy of Sciences, vol. 42 , pp. 535–538. - Tsutomu Hosoi. The separable axiomatization of the intermediate propositional systems Sn of Gödei. Proceedings of the Japan Academy of Sciences, vol. 42 , pp. 1001–1006. [REVIEW]Alfred Horn - 1969 - Journal of Symbolic Logic 34 (3):505.
  16.  12
    Notes on Wajsberg's Proof of the Separation Theorem.M. N. Bezhanishvili - 1987 - In Jan T. J. Srzednicki (ed.), Initiatives in Logic. M. Nijhoff. pp. 116--127.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  17.  11
    Hosoi Tsutomu. The separation theorem on the classical system. Journal of the Faculty of Science, University of Tokyo, section I, Mathematics, astronomy, physics, chemistry, vol. 12 part 2 , pp. 223–230. [REVIEW]T. Thacher Robinson - 1968 - Journal of Symbolic Logic 33 (1):128-128.
  18.  12
    Syntactical Proof of Translation and Separation Theorems on Subsystems of Elementary Ontology.Mitio Takano - 1991 - Mathematical Logic Quarterly 37 (9‐12):129-138.
  19.  33
    Syntactical Proof of Translation and Separation Theorems on Subsystems of Elementary Ontology.Mitio Takano - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (9-12):129-138.
  20.  37
    Rule Separation and Embedding Theorems for Logics Without Weakening.Clint J. van Alten & James G. Raftery - 2004 - Studia Logica 76 (2):241-274.
    A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  21.  9
    Rule Separation and Embedding Theorems for Logics Without Weakening.C. J. van Alten & J. G. Raftery - 2004 - Studia Logica 76 (2):241-274.
    A full separation theorem for the derivable rules of intuitionistic linear logic without bounds, 0 and exponentials is proved. Several structural consequences of this theorem for subreducts of (commutative) residuated lattices are obtained. The theorem is then extended to the logic LR+ and its proof is extended to obtain the finite embeddability property for the class of square increasing residuated lattices.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  22. Non-separability Does Not Relieve the Problem of Bell’s Theorem.Joe Henson - 2013 - Foundations of Physics 43 (8):1008-1038.
    This paper addresses arguments that “separability” is an assumption of Bell’s theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as “holism”) will allow us to restore a satisfying locality principle. Separability here means that all events associated to the union of some set of disjoint regions are combinations of events associated to each region taken separately.In this article, it is shown that: (a) localised events can be consistently defined without (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  23.  22
    Tsutomu Hosoi. Algebraic proof of the separation theorem on classical propositional calculus. Proceedings of the Japan Academy, vol. 42 , pp. 67–69. - Tsutomu Hosoi. Algebraic proof of the separation theorem on Dummett's LC. Proceedings of the Japan Academy, vol. 42 , pp. 693–695. [REVIEW]Alfred Horn - 1968 - Journal of Symbolic Logic 33 (1):128-129.
  24.  28
    A separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov's principle.Josef Berger & Gregor Svindland - 2016 - Annals of Pure and Applied Logic 167 (11):1161-1170.
  25.  18
    Separating principles below Ramsey's theorem for pairs.Manuel Lerman, Reed Solomon & Henry Towsner - 2013 - Journal of Mathematical Logic 13 (2):1350007.
    In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from RT, Ramsey's Theorem for Pairs. These principles tend to fall outside of the "big five" systems of reverse mathematics and a complicated picture of subsystems below RT has emerged. In this paper, we answer two open questions concerning these subsystems, specifically that ADS is not equivalent to CAC and that EM is not equivalent to RT.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  26.  23
    Separating the Fan theorem and its weakenings.Robert S. Lubarsky & Hannes Diener - 2014 - Journal of Symbolic Logic 79 (3):792-813.
    Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Some of the implications have been shown to be strict, others strict in a weak context, and yet others not at all, using disparate techniques. Here we present a family of related Kripke models which separates all of the as yet identified fan theorems.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  13
    Separating the Fan theorem and its weakenings II.Robert S. Lubarsky - 2019 - Journal of Symbolic Logic 84 (4):1484-1509.
    Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Earlier work showed all of these implications to be strict. Here we reprove one of the strictness results, using very different arguments. The technique used is a mixture of realizability, forcing in the guise of Heyting-valued models, and Kripke models.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  25
    How Incomputable Is the Separable Hahn-Banach Theorem?Guido Gherardi & Alberto Marcone - 2009 - Notre Dame Journal of Formal Logic 50 (4):393-425.
    We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König's Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multivalued function Sep and a natural notion of reducibility for multivalued functions, we obtain a computational counterpart of the subsystem of second-order arithmetic WKL0. We study analogies and differences between WKL0 and the class (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  29.  64
    Separability in Population Ethics.Teruji Thomas - 2022 - In Gustaf Arrhenius, Krister Bykvist, Tim Campbell & Elizabeth Finneron-Burns (eds.), The Oxford Handbook of Population Ethics. Oxford University Press. pp. 271-295.
    Separability is roughly the principle that, in comparing the value of two outcomes, one can ignore any people whose existence and welfare are unaffected. Separability is both antecedently plausible, at least as a principle of beneficence, and surprisingly powerful; it is the key to some of the best positive arguments in population ethics. This chapter surveys the motivations for and consequences of separability. In particular, it presents an ‘additivity theorem’ which explains how separability leads to total (...)
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  30.  36
    Which set existence axioms are needed to prove the separable Hahn-Banach theorem?Douglas K. Brown & Stephen G. Simpson - 1986 - Annals of Pure and Applied Logic 31:123-144.
  31.  53
    Brouwer’s Fan Theorem as an axiom and as a contrast to Kleene’s alternative.Wim Veldman - 2014 - Archive for Mathematical Logic 53 (5):621-693.
    The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic Mathematics BIM, and then search for statements that are, over BIM, equivalent to Brouwer’s Fan Theorem or to its positive denial, Kleene’s Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene’s Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene’s Alternative is, intuitionistically, a nontrivial (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  32.  40
    Separation and weak könig's lemma.A. James Humphreys & Stephen G. Simpson - 1999 - Journal of Symbolic Logic 64 (1):268-278.
    We continue the work of [14, 3, 1, 19, 16, 4, 12, 11, 20] investigating the strength of set existence axioms needed for separable Banach space theory. We show that the separation theorem for open convex sets is equivalent to WKL 0 over RCA 0 . We show that the separation theorem for separably closed convex sets is equivalent to ACA 0 over RCA 0 . Our strategy for proving these geometrical Hahn-Banach theorems is to reduce to the finite-dimensional (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33. Separation and Weak Konig's Lemma.A. Humphreys & Stephen Simpson - 1999 - Journal of Symbolic Logic 64 (1):268-278.
    We continue the work of [14, 3, 1, 19, 16, 4, 12, 11, 20] investigating the strength of set existence axioms needed for separable Banach space theory. We show that the separation theorem for open convex sets is equivalent to WKL$_0$ over RCA$_0$. We show that the separation theorem for separably closed convex sets is equivalent to ACA$_0$ over RCA$_0$. Our strategy for proving these geometrical Hahn-Banach theorems is to reduce to the finite-dimensional case by means of a compactness (...)
     
    Export citation  
     
    Bookmark   1 citation  
  34. Separability of Quantum States vs. Original Bell (1964) Inequalities.Marek Żukowski - 2006 - Foundations of Physics 36 (4):541-545.
    All separable states satisfy all Bell-type inequalities, which involve as their assumption only existence of local realistic (local hidden variable) models of the correlations of spatially separated systems, observed by two or more observers making independent decisions on what to measure (free will). The recent observation by Loubenets, that some separable states do not satisfy the original Bell inequality (1964) has no consequences whatsoever for the studies of the relation of separability with local realism. The original Bell inequality was (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  20
    We announce two new dichotomy theorems for Borel equivalence rela-tions, and present the results in context by giving an overview of related recent developments. § 1. Introduction. For X a Polish (ie, separable, completely metrizable) space and E a Borel equivalence relation on X, a (complete) classification. [REVIEW]Greg Hjorth & Alexander S. Kechris - 1997 - Bulletin of Symbolic Logic 3 (3):329-346.
    We announce two new dichotomy theorems for Borel equivalence relations, and present the results in context by giving an overview of related recent developments.§1. Introduction. For X a Polish space and E a Borel equivalence relation on X, a classification of X up to E-equivalence consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c = c. To be of any value we would expect I and c to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  36. Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
    Let A be a standard transitive admissible set. Σ 1 -separation is the principle that whenever X and Y are disjoint Σ A 1 subsets of A then there is a Δ A 1 subset S of A such that $X \subseteq S$ and $Y \cap S = \varnothing$ . Theorem. If A satisfies Σ 1 -separation, then (1) If $\langle T_n\mid n is a sequence of trees on ω each of which has at most finitely many infinite paths in (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  37. The Strong Free Will Theorem.John H. Conway - unknown
    The two theories that revolutionized physics in the twentieth century, relativity and quantum mechanics, are full of predictions that defy common sense. Recently, we used three such paradoxical ideas to prove “The Free Will Theorem” (strengthened here), which is the culmination of a series of theorems about quantum mechanics that began in the 1960s. It asserts, roughly, that if indeed we humans have free will, then elementary particles already have their own small share of this valuable commodity. More precisely, (...)
     
    Export citation  
     
    Bookmark   50 citations  
  38. Reformulating Bell's theorem: The search for a truly local quantum theory.Mordecai Waegell & Kelvin J. McQueen - 2020 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 70:39-50.
    The apparent nonlocality of quantum theory has been a persistent concern. Einstein et al. and Bell emphasized the apparent nonlocality arising from entanglement correlations. While some interpretations embrace this nonlocality, modern variations of the Everett-inspired many worlds interpretation try to circumvent it. In this paper, we review Bell's "no-go" theorem and explain how it rests on three axioms, local causality, no superdeterminism, and one world. Although Bell is often taken to have shown that local causality is ruled out by the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  26
    On Separating the Wheat from the Chaff: Surplus Structure and Artifacts in Scientific Theories.Marie Gueguen - 2019 - Dissertation, University of Western Ontario
    Although logical empiricism is now mostly decried, their naturalist claim that the content of a theory can be read off from its structure, without any philosophical considerations needed, still supports traditional strategies to escape cases of underdetermination. The appeal to theoretical equivalence or to theoretical virtues, for instance, both assume that there is a neutral standpoint from which the structure of the theories can be analyzed, the physically relevant from the superfluous separated, and a comparison made between their theoretical content (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  15
    Bell's Theorem: The Price of Locality.Tim Maudlin - 2002-01-01 - In Quantum Non‐Locality and Relativity. Tim Maudlin. pp. 6–26.
    This chapter contains sections titled: Polarization Light Quanta The Entangled State How Do They Do It? Bell's Theorem(s) Aspect's Experiment What Is Weird About the Quantum Connection? Appendix A: The GHZ Scheme.
    Direct download  
     
    Export citation  
     
    Bookmark  
  41. The Kochen - Specker theorem in quantum mechanics: a philosophical comment (part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine – (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  19
    Completely separable mad families and the modal logic of βω.Tomáš Lávička & Jonathan L. Verner - 2022 - Journal of Symbolic Logic 87 (2):498-507.
    We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega $ implies that the modal logic $\mathbf {S4.1.2}$ is complete with respect to the Čech–Stone compactification of the natural numbers, the space $\beta \omega $. In the same fashion we prove that the modal logic $\mathbf {S4}$ is complete with respect to the space $\omega ^*=\beta \omega \setminus \omega $. This improves the results of G. Bezhanishvili and J. Harding in [4], where (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  35
    Quantum structures, separated physical entities and probability.Diederik Aerts - 1994 - Foundations of Physics 24 (9):1227-1259.
    We prove that if the physical entity S consisting of two separated physical entities S1 and S2 satisfies the axioms of orthodox quantum mechanics, then at least one of the two subentities is a classical physical entity. This theorem implies that separated quantum entities cannot be described by quantum mechanics. We formulate this theorem in an approach where physical entities are described by the set of their states, and the set of their relevant experiments. We also show that the collection (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  44.  26
    The 'No-Supervenience' Theorem and its Implications for Theories of Consciousness.Catherine M. Reason - 2024 - Journal of Consciousness Studies 31 (1):138-148.
    The 'no-supervenience' theorem (Reason, 2019; Reason and Shah, 2021) is a proof that no fully self-aware system can entirely supervene on any objectively observable system. I here present a simple, non-technical summary of the proof and demonstrate its implications for four separate theories of consciousness: the 'property dualism' theory of David Chalmers; the 'reflexive monism' of Max Velmans; Galen Strawson's 'realistic monism'; and the 'illusionism' of Keith Frankish. It is shown that all are ruled out in their current form by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  33
    Separate common causes and EPR correlations---a no-go result.Tomasz Placek & Leszek Wroński - unknown
    One diagnosis of Bell's theorem is that its premise of Outcome Independence is unreasonably strong, as it postulates one common screener system that purports to explain all the correlations involved. This poses a challenge of constructing a model for quantum correlations that is local, non-conspiratorial, and has many separate screener systems rather than one common screener system. In particular, the assumptions of such models should not entail Bell's inequalities. We prove that the models described do not exist, and hence, the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  27
    Completely separable mad families and the modal logic of.Tomáš Lávička & Jonathan L. Verner - 2020 - Journal of Symbolic Logic:1-10.
    We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega $ implies that the modal logic $\mathbf {S4.1.2}$ is complete with respect to the Čech–Stone compactification of the natural numbers, the space $\beta \omega $. In the same fashion we prove that the modal logic $\mathbf {S4}$ is complete with respect to the space $\omega ^*=\beta \omega \setminus \omega $. This improves the results of G. Bezhanishvili and J. Harding in [4], where (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  91
    Bell on Bell's theorem: The changing face of nonlocality.Harvey R. Brown & Christopher Gordon Timpson - unknown
    Between 1964 and 1990, the notion of nonlocality in Bell's papers underwent a profound change as his nonlocality theorem gradually became detached from quantum mechanics, and referred to wider probabilistic theories involving correlations between separated beables. The proposition that standard quantum mechanics is itself nonlocal became divorced from the Bell theorem per se from 1976 on, although this important point is widely overlooked in the literature. In 1990, the year of his death, Bell would express serious misgivings about the mathematical (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48.  30
    Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
    In the Böhm theorem workshop on Crete, Zoran Petric called Statman’s “Typical Ambiguity theorem” the typed Böhm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment of intuitionistic linear logic without the multiplicative unit the weak typed Böhm theorem holds. The system IMLL (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  30
    Riesz representation theorem, Borel measures and subsystems of second-order arithmetic.Xiaokang Yu - 1993 - Annals of Pure and Applied Logic 59 (1):65-78.
    Yu, X., Riesz representation theorem, Borel measures and subsystems of second-order arithmetic, Annals of Pure and Applied Logic 59 65-78. Formalized concept of finite Borel measures is developed in the language of second-order arithmetic. Formalization of the Riesz representation theorem is proved to be equivalent to arithmetical comprehension. Codes of Borel sets of complete separable metric spaces are defined and proved to be meaningful in the subsystem ATR0. Arithmetical transfinite recursion is enough to prove the measurability of Borel sets for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  50.  17
    Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
    We define and study a new restricted consistency notion RCon ∗ for bounded arithmetic theories T 2 j . It is the strongest ∀ Π 1 b -statement over S 2 1 provable in T 2 j , similar to Con in Krajíček and Pudlák, 29) or RCon in Krajı́ček and Takeuti 107). The advantage of our notion over the others is that RCon ∗ can directly be used to construct models of T 2 j . We apply this by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000