About this topic
Summary When a mathematical theory is decidable we are able to check in some mechanistic fashion whether some well-formed statement in the language of the theory is a theorem (lemma, corollary, etc.). More precisely, a theory is decidable when the set of theorems (lemmas, corollaries, etc.) is recursive. A theory is undecidable, naturally, when this is not the case. Given that completeness and decidability go hand in hand, when we have found an incomplete theory we have also found an undecidable theory. So, Gödel's incompleteness results yield the further result of showing these incomplete theories also have the feature of not being able to check whether the set of theorems is recursive.
Key works Church (1936a), Gödel (Collected Works), Turing, Mostowski, and Robinson (1953), Davis (1977)
Related categories

30 found
Order:
  1. added 2020-06-08
    불일치, 결정 불가능, 임의, 계산 가능 및 불완전한 의미는 무엇입니까? '고델의 길 : 결정 불가능한 세상으로의 착취'에 대한 검토 (Godel's Way: Exploits into an undecidable world) by Gregory Chaitin, Francisco A Doria, Newton C.A. da Costa 160p (2012).Michael Richard Starks - 2020 - In 지구상의 지옥에 오신 것을 환영합니다 : 아기, 기후 변화, 비트 코인, 카르텔, 중국, 민주주의, 다양성, 역학, 평등, 해커, 인권, 이슬람, 자유주의, 번영, 웹, 혼돈, 기아, 질병, 폭력, 인공 지능, 전쟁. Las Vegas, NV USA: Reality Press. pp. 187-203.
    'Godel's Way'에서 세 명의 저명한 과학자들은 부정성, 불완전성, 임의성, 계산성 및 파라불일치와 같은 문제에 대해 논의합니다. 나는 완전히 다른 해결책을 가지고 두 가지 기본 문제가 있다는 비트 겐슈타인의 관점에서 이러한 문제에 접근. 과학적 또는 경험적 문제가 있다, 관찰 하 고 철학적 문제 언어를 어떻게 이해할 수 있는 (수학 및 논리에 특정 질문을 포함) 에 대 한 조사 해야 하는 세계에 대 한 사실,우리가 실제로 특정 컨텍스트에서 단어를 사용 하는 방법을 보고 하 여 결정 될 필요가. 우리가 어떤 언어 게임을 하고 (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. added 2019-12-21
    Wolpert, Chaitin e Wittgenstein em impossibilidade, incompletude, o paradoxo do mentiroso, o teísmo, os limites da computação, um princípio de incerteza mecânica não quântica e o universo como computador — o teorema final na teoria da máquina de Turing (revisado 2019).Michael Richard Starks - 2019 - In Delírios Utópicos Suicidas no Século XXI Filosofia, Natureza Humana e o Colapso da Civilization- Artigos e Comentários 2006-2019 5ª edição. Las Vegas, NV USA: Reality Press. pp. 183-187.
    Eu li muitas discussões recentes sobre os limites da computação e do universo como computador, na esperança de encontrar alguns comentários sobre o trabalho surpreendente do físico polimatemático e teórico da decisão David Wolpert, mas não encontrei uma única citação e assim que eu apresento este muito breve Resumo. Wolpert provou alguma impossibilidade impressionante ou teoremas da incompletude (1992 a 2008-Veja arxiv dot org) nos limites à inferência (computação) que são tão gerais que são independentes do dispositivo que faz a (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. added 2019-12-04
    Reseña de ‘I am a Strange Loop’ (Soy un Lazo Extraño) de Douglas Hofstadter (2007) (revisión revisada 2019).Michael Richard Starks - 2019 - In Delirios Utópicos Suicidas en el Siglo 21 La filosofía, la naturaleza humana y el colapso de la civilización Artículos y reseñas 2006-2019 4a Edición. Las Vegas, NV USA: Reality Press. pp. 205-221.
    Último sermón de la iglesia del naturalismo fundamentalista por el pastor Hofstadter. Al igual que su mucho más famoso (o infame por sus incesantemente errores filosóficos) trabajo Godel, Escher, Bach, tiene una plausibilidad superficial, pero si se entiende que se trata de un científico rampante que mezcla problemas científicos reales con los filosóficos (es decir, el sólo los problemas reales son los juegos de idiomas que debemos jugar) entonces casi todo su interés desaparece. Proporciono un marco para el análisis basado (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. added 2019-09-04
    Remarques sur l'impossibilité l'incomplétude, la paracohérence l'indécision, le hasard, la calculabilité, le paradoxe et l'incertitude - dans Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria da Costa, Godel, Searle, Rodych, Berto Floyd, Moyal-Sharrock et Yanofsky.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    On pense généralement que l'impossibilité, l'incomplétdulité, la paracohérence, l'indécidabilité, le hasard, la calcul, le paradoxe, l'incertitude et les limites de la raison sont des questions scientifiques physiques ou mathématiques disparates ayant peu ou rien dans terrain d'entente. Je suggère qu'ils sont en grande partie des problèmes philosophiques standard (c.-à-d., jeux de langue) qui ont été la plupart du temps résolus par Wittgenstein plus de 80 ans. Je fournis un bref résumé de quelques-unes des principales conclusions de deux des plus éminents (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  5. added 2019-08-28
    Pernyataan tentang kemustahilan, ketidaklengkapan, Paraconsistency,Undecidability, Randomness, Komputabilitas, paradoks, dan ketidakpastian dalam Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal-Sharrock dan Yanofsky.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    Hal ini sering berpikir bahwa kemustahilan, ketidaklengkapan, Paraconsistency, Undecidability, Randomness, komputasi, Paradox, ketidakpastian dan batas alasan yang berbeda ilmiah fisik atau matematika masalah memiliki sedikit atau tidak ada dalam Umum. Saya menyarankan bahwa mereka sebagian besar masalah filosofis standar (yaitu, Permainan bahasa) yang sebagian besar diselesaikan oleh Wittgenstein lebih dari 80years yang lalu. -/- "Apa yang kita ' tergoda untuk mengatakan ' dalam kasus seperti ini, tentu saja, bukan filsafat, tetapi bahan baku. Jadi, misalnya, apa yang seorang matematikawan cenderung mengatakan (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. added 2019-08-27
    اظهارات در مورد عدم امکان ، بی کامل بودن ، پاراستشتها، Undecidability ، اتفاقی ، Computability ، پارادوکس ، و عدم قطعیت در Chaitin ، ویتگنشتاین ، Hofstadter ، Wolpert ، doria ، دا کوستا ، گودل ، سرل ، رودیچ ، برتو ، فلوید ، مویال-شرراک و یانفسکی.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    معمولا تصور می شود که عدم امکان ، بی کامل بودن ، پارامونشتها ، Undecidability ، اتفاقی ، قابلیت های مختلف ، پارادوکس ، عدم قطعیت و محدودیت های دلیل ، مسائل فیزیکی و ریاضی علمی و یا با داشتن کمی یا هیچ چیز در مشترک. من پیشنهاد می کنم که آنها تا حد زیادی مشکلات فلسفی استاندارد (به عنوان مثال ، بازی های زبان) که عمدتا توسط ویتگنشتاین بیش از 80 سال پیش حل و فصل شد. -/- "آنچه ما (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  7. added 2019-08-25
    关于在柴廷、维特根斯坦、霍夫施塔特、沃尔珀特、多里亚、达科斯塔、戈德尔、西尔、罗迪赫、贝托、弗洛伊德、贝托、弗洛伊德、莫亚尔-沙罗克和亚诺夫斯基.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    人们普遍认为,不可能性、不完整性、不一致性、不可度、随机性、可预见性、悖论、不确定性和理性极限是完全不同的科学物理或数学问题,在常见。我认为,它们主要是标准的哲学问题(即语言游戏),这些问题大多在80 多年前由维特根斯坦解决。 -/- "在这种情况下,我们'想说'当然不是哲学,而是它的原材料。因此,例如,数学家倾向于对数学事实的客观性和现实性说的,不是数学哲学,而是哲学处理的东西。维特根斯坦 PI 234 -/- "哲学家们经常看到科学的方法,他们不可抗拒地试图以科学的方式提问和回答问题。这种倾向是形而上学的真正源泉,将哲学家带入完全的黑暗之中。 维特根斯坦 -/- 我简要地总结了现代两位最杰出的学生路德维希·维特根斯坦和约翰·西尔关于故意的逻辑结构(思想、语言、行为)的一些主要发现,作为我的起点Wittgenstein 的基本发现——所有真正的"哲学"问题都是相同的——关于在特定上下文中如何使用语言的困惑,因此所有解决方案都是一样的——研究如何在相关上下文中使用语言,使其真实性条件(满意度或 COS 条件)是明确的。基本问题是,人们可以说什么,但一个人不能意味着(状态明确COS)任何任意的话语和意义只有在非常具体的上下文中才可能。 -/- 在两种思想体系的现代视角(被推广为"思维快,思维慢")的框架内,我从维特根斯坦人的角度剖析了一些主要评论员关于这些问题的一些著作,并采用了一个新的表意向性和新的双系统命名法。 我表明,这是一个强大的启发式描述这些假定的科学,物理或数学问题的真实性质,这是真正最好的处理作为标准哲学问题,如何使用语言(语言游戏在维特根斯坦的术语)。 -/- 我的论点是,这里突出特征的意向表(理性、思想、思想、语言、个性等)或多或少地准确地描述了,或者至少作为启发式,我们思考和行为的方式,所以它包含不只是哲学和心理学,但其他一切(历史,文学,数学,政治等) 。特别要注意,我(以及西尔、维特根斯坦和其他人)认为,故意和理性包括有意识的审议语言系统2和无意识的自动预语言系统1行为或反射。 .
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8. added 2019-06-20
    Proof That Wittgenstein is Correct About Gödel.P. Olcott - manuscript
    The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic property of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide valid the deductive inference. Conclusions of sound arguments are derived from truth preserving finite string transformations applied to true premises.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. added 2019-04-20
    Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  10. added 2019-03-03
    Provability, Mechanism, and the Diagonal Problem.Graham Leach-Krouse - 2016 - In Leon Horsten & Philip Welch (eds.), Gödel's Disjunction: the Scope and Limits of Mathematical Knowledge. Oxford, UK: pp. 211-240.
  11. added 2019-02-24
    Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language works. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  12. added 2019-02-06
    Pluralism and the Liar.Cory Wright - 2017 - In Bradley Armour-Garb (ed.), Reflections on the Liar. Oxford University Press. pp. 347–373.
    Pluralists maintain that there is more than one truth property in virtue of which bearers are true. Unfortunately, it is not yet clear how they diagnose the liar paradox or what resources they have available to treat it. This chapter considers one recent attempt by Cotnoir (2013b) to treat the Liar. It argues that pluralists should reject the version of pluralism that Cotnoir assumes, discourse pluralism, in favor of a more naturalized approach to truth predication in real languages, which should (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. added 2018-05-11
    What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  14. added 2018-02-17
    Three Concepts of Decidability for General Subsets of Uncountable Spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
    There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15. added 2018-01-04
    On the Decidability of Axiomatized Mereotopological Theories.Hsing-Chien Tsai - 2015 - Notre Dame Journal of Formal Logic 56 (2):287-306.
    The signature of the formal language of mereotopology contains two predicates $P$ and $C$, which stand for “being a part of” and “contact,” respectively. This paper will deal with the decidability issue of the mereotopological theories which can be formed by the axioms found in the literature. Three main results to be given are as follows: all axiomatized mereotopological theories are separable; all mereotopological theories up to $\mathbf{ACEMT}$, $\mathbf{SACEMT}$, or $\mathbf{SACEMT}^{\prime}$ are finitely inseparable; all axiomatized mereotopological theories except $\mathbf{SAX}$, $\mathbf{SAX}^{\prime}$, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16. added 2018-01-04
    A Comprehensive Picture of the Decidability of Mereological Theories.Hsing-Chien Tsai - 2013 - Studia Logica 101 (5):987-1012.
    The signature of the formal language of mereology contains only one binary predicate which stands for the relation “being a part of” and it has been strongly suggested that such a predicate must at least define a partial ordering. Mereological theories owe their origin to Leśniewski. However, some more recent authors, such as Simons as well as Casati and Varzi, have reformulated mereology in a way most logicians today are familiar with. It turns out that any theory which can be (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17. added 2018-01-04
    More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
    Quite a few results concerning the decidability of mereological theories have been given in my previous paper. But many mereological theories are still left unaccounted for. In this paper I will refine a general method for proving the undecidability of a theory and then by making use of it, I will show that most mereological theories that are strictly weaker than CEM are finitely inseparable and hence undecidable. The same results might be carried over to some extensions of those weak (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  18. added 2018-01-04
    Decidability of Mereological Theories.Hsing-Chien Tsai - 2009 - Logic and Logical Philosophy 18 (1):45-63.
    Mereological theories are theories based on a binary predicate ‘being a part of’. It is believed that such a predicate must at least define a partial ordering. A mereological theory can be obtained by adding on top of the basic axioms of partial orderings some of the other axioms posited based on pertinent philosophical insights. Though mereological theories have aroused quite a few philosophers’ interest recently, not much has been said about their meta-logical properties. In this paper, I will look (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  19. added 2017-11-09
    Fourteen Arguments in Favour of a Formalist Philosophy of Real Mathematics.Karlis Podnieks - 2015 - Baltic Journal of Modern Computing 3 (1):1-15.
    The formalist philosophy of mathematics (in its purest, most extreme version) is widely regarded as a “discredited position”. This pure and extreme version of formalism is called by some authors “game formalism”, because it is alleged to represent mathematics as a meaningless game with strings of symbols. Nevertheless, I would like to draw attention to some arguments in favour of game formalism as an appropriate philosophy of real mathematics. For the most part, these arguments have not yet been used or (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. added 2016-10-14
    Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Limits of Computation, Theism and the Universe as Computer-the Ultimate Turing Theorem.Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization Michael Starks 3rd Ed. (2017).
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  21. added 2015-06-14
    What Does Gödel's Second Theorem Say?Michael Detlefsen - 2001 - Philosophia Mathematica 9 (1):37-71.
    We consider a seemingly popular justification (we call it the Re-flexivity Defense) for the third derivability condition of the Hilbert-Bernays-Löb generalization of Godel's Second Incompleteness Theorem (G2). We argue that (i) in certain settings (rouglily, those where the representing theory of an arithmetization is allowed to be a proper subtheory of the represented theory), use of the Reflexivity Defense to justify the tliird condition induces a fourth condition, and that (ii) the justification of this fourth condition faces serious obstacles. We (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  22. added 2015-05-23
    Solvable Cases of the Decision Problem.W. Ackermann - 1954 - Amsterdam: North-Holland Pub. Co..
  23. added 2014-04-03
    On First-Order Theories with Provability Operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
    In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  24. added 2014-04-03
    Unbounded Operators and the Incompleteness of Quantum Mechanics.Adrian Heathcote - 1990 - Philosophy of Science 57 (3):523-534.
    A proof is presented that a form of incompleteness in Quantum Mechanics follows directly from the use of unbounded operators. It is then shown that the problems that arise for such operators are not connected to the non- commutativity of many pairs of operators in Quantum Mechanics and hence are an additional source of incompleteness to that which allegedly flows from the..
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  25. added 2014-03-14
    Incompleteness in a General Setting (Vol 13, Pg 21, 2007).John Bell - 2008 - Bulletin of Symbolic Logic 14 (1):21 - 30.
    Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language (typically, that of arithmetic) within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number of efforts have been made to present the essentials of the proofs of Gödel’s theorems without getting (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  26. added 2014-03-14
    Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System.Matthew W. Parker - 2003 - Philosophy of Science 70 (2):359-382.
    Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer (...)
    Remove from this list   Direct download (11 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27. added 2014-03-12
    Corrigendum to “Incompleteness in a General Setting”.John L. Bell - 2008 - Bulletin of Symbolic Logic 14 (1):122-122.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28. added 2014-03-08
    The Gödel Paradox and Wittgenstein's Reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
    An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  29. added 2012-01-08
    The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.Michael Beeson - 1976 - Journal of Symbolic Logic 41 (1):18-24.
  30. added 2011-09-06
    Reflections on Concrete Incompleteness.G. Longo - 2011 - Philosophia Mathematica 19 (3):255-280.
    How do we prove true but unprovable propositions? Gödel produced a statement whose undecidability derives from its ad hoc construction. Concrete or mathematical incompleteness results are interesting unprovable statements of formal arithmetic. We point out where exactly the unprovability lies in the ordinary ‘mathematical’ proofs of two interesting formally unprovable propositions, the Kruskal-Friedman theorem on trees and Girard's normalization theorem in type theory. Their validity is based on robust cognitive performances, which ground mathematics in our relation to space and time, (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation