Can Science Prove That God Exists?

Heythrop Journal 3 (2):126-138 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1111/j.1468-2265.1962.tb00285.x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Can science prove that God exists?J. Macdonald Smith - 1962 - Heythrop Journal 3 (2):126–138.
No, Science Cannot Prove That God Exists.Bobby Treat - 2001 - Free Inquiry 21.
A Finite Model-theoretical Proof Of A Property Of Bounded Query Classes Within Ph.Leszek Aleksander Kołodziejczyk - 2004 - Journal of Symbolic Logic 69 (4):1105-1116.
Axiomatizability by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\forall}{\exists}!}$$\end{document}-sentences. [REVIEW]Miguel Campercholi & Diego Vaggione - 2011 - Archive for Mathematical Logic 50 (7-8):713-725.
Martin's axioms, measurability and equiconsistency results.Jaime I. Ihoda & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (1):78-94.
Exact equiconsistency results for Δ 3 1 -sets of reals.Haim Judah - 1992 - Archive for Mathematical Logic 32 (2):101-112.
Universal Spaces for Classes of Scattered Eberlein Compact Spaces.Murray Bell & Witold Marciszewski - 2006 - Journal of Symbolic Logic 71 (3):1073 - 1080.
A fixed point for the jump operator on structures.Antonio Montalbán - 2013 - Journal of Symbolic Logic 78 (2):425-438.
The hard problem is dead: Long live the hard problem.Teed Rockwell - manuscript
Fragments of Heyting arithmetic.Wolfgang Burr - 2000 - Journal of Symbolic Logic 65 (3):1223-1240.
The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
A measure-theoretic proof of Turing incomparability.Chris J. Conidis - 2010 - Annals of Pure and Applied Logic 162 (1):83-88.
Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.
Changing the heights of automorphism towers.Joel David Hamkins & Simon Thomas - 2000 - Annals of Pure and Applied Logic 102 (1-2):139-157.
Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.

Analytics

Added to PP
2017-02-20

Downloads
6 (#1,456,990)

6 months
2 (#1,188,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references