February 2004 Archives by author
Starting: Sun Feb 1 13:42:23 EDT 2004
Ending: Sun Feb 29 13:49:48 EDT 2004
Messages: 113
- [FOM]CT
Hajnal Andreka
- [FOM] ESSLLI 04: Registration Open
Carlos Areces
- [FOM] Symposia in Tel-Aviv University
Arnon Avron
- [FOM] Re: On physical Church-Turing Thesis
Eric Baum
- [FOM] 5th Annual Graduate Student Conference in Logic
Wesley Calvert
- [FOM] Characterization of Linear Continua
Jacques Carette
- [FOM] CombLog04 - NEW DEADLINE: March 01, 2004.
Walter Carnielli
- [FOM] Quadruples instead of quintuples in TM's
Walter Carnielli
- [FOM] Re: Is Chess ripe for foundational exposition/research?
Timothy Y. Chow
- [FOM] Re: Is Chess ripe for foundational exposition/research?
Timothy Y. Chow
- [FOM] Re: Chess as science?
Timothy Y. Chow
- [FOM] S. Barry Cooper's book "Computability Theory"
Timothy Y. Chow
- [FOM] The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: A Newtonian computing design
Timothy Y. Chow
- [FOM] Re: A Newtonian computing design
Timothy Y. Chow
- [FOM] Re: The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: The Myth of Hypercomputation
Timothy Y. Chow
- [FOM] Re: Empirically relevant undecidability
Timothy Y. Chow
- [FOM] Re: Crystal Ball Theory
Timothy Y. Chow
- [FOM] Reverse mathematics, search problems, and bounded arithmetic
Timothy Y. Chow
- [FOM] Ineffective proofs and weak systems
Timothy Y. Chow
- [FOM] CFP Workshop on questions
Ileana Comorovski
- [FOM] Non-Turing computations
José Félix Costa
- [FOM] On foundations of special relativity
José Félix Costa
- [FOM] On Physical Church-Turing Thesis
José Félix Costa
- [FOM] On Physical Church-Turing Thesis
José Félix Costa
- [FOM] On Physical Church-Turing Thesis
José Félix Costa
- [FOM] Preliminary Announcement ESSLLI 2004
Martin Davis
- [FOM] CfP Workshop of guarded logics ESSLLI'04
Martin Davis
- [FOM] ESSLLI 2004: Preliminary Announcement
Martin Davis
- [FOM] LCMAS@ESSLLI Final CFP
Martin Davis
- [FOM] Re: On Physical Church-Turing Thesis
Martin Davis
- [FOM] telling whether a program terminates
Martin Davis
- [FOM] Tien Kieu and the Quantum Adiabatic Theorem
Martin Davis
- [FOM] apology and warning
Martin Davis
- [FOM] recursive vs. computable (Toby Ord)
Martin Davis
- [FOM] Turing machines: quadruples vs quintuples
Martin Davis
- [FOM] Deadline extension : ESSLLI'04 Student Session
Paul Egré
- [FOM] Historical notation question
H. Enderton
- [FOM] Re: FOM Digest, Vol 14, Issue 10
Adam Epstein
- [FOM] cofinite quantifier (fwd)
Thomas Forster
- [FOM] Re: Combining classical and intuitionistic features in one logic
Matthew Frank
- [FOM] 210:Coding in Reverse Mathematics 1
Harvey Friedman
- [FOM] Is Chess ripe for foundational exposition/research?
Harvey Friedman
- [FOM] Re: Is Chess ripe for foundational exposition/research?
Harvey Friedman
- [FOM] 211:Coding in Reverse Mathematics 2
Harvey Friedman
- [FOM] Characterization of Linear Continua
Harvey Friedman
- [FOM] Finite Axiomatization of Class Theory
Harvey Friedman
- [FOM] Chess as science?
Harvey Friedman
- [FOM] Continua/Finite Axiomatization
Harvey Friedman
- [FOM] 212:On foundations of special relativistic kinematics 4
Harvey Friedman
- [FOM] 213:On foundations of special relativistic kinematics 5
Harvey Friedman
- [FOM] On Physical Church-Turing Thesis
Harvey Friedman
- [FOM] About ln |x|
Harvey Friedman
- [FOM] A Newtonian computing design
Harvey Friedman
- [FOM] Re: A Newtonian computing design
Harvey Friedman
- [FOM] 214:On foundations of special relativistic kinematics 6
Harvey Friedman
- [FOM] Crystal Ball Theory
Harvey Friedman
- [FOM] 215:Special Relativity Corrections
Harvey Friedman
- [FOM] Re: Crystal Ball Theory
Harvey Friedman
- [FOM] Ineffective proofs and weak systems
Harvey Friedman
- [FOM] CFP
Elana Geller
- [FOM] Historical notation question
Jeff Hirst
- [FOM] Re: The Myth of Hypercomputation
JoeShipman at aol.com
- [FOM] Re: The Myth of Hypercomputation
Aatu Koskensilta
- [FOM] Kolmogorov Lecture announcement
Vladik Kreinovich
- [FOM] Combining classical and intuitionistic features in one logic
Vladik Kreinovich
- [FOM] Re: The Myth of Hypercomputation
Piyush P Kurur
- [FOM] nieve continuum metaphysics
Stephen Lavelle
- [FOM] Sets and Proper Classes
Robert Lindauer
- [FOM] Re: Combining classical and intuitionistic features in one logic
Joao Marcos
- [FOM] Re: Combining classical and intuitionistic features in one logic
Joao Marcos
- [FOM] Neil Tennant's Questions
F.A. Muller
- [FOM] Re: Physical Church Thesis
Istvan Nemeti
- [FOM] Re: physical Church Thesis, correction of Internet address
Istvan Nemeti
- [FOM] On foundations of special relativity
Istvan Nemeti
- [FOM] Re: On foundations of special relativity (Twin Paradox)
Istvan Nemeti
- [FOM] Re: On foundation of Special Relativistic Kinematics 4
Istvan Nemeti
- [FOM] Ants, Elephants, and Special Principle of Relativity
Istvan Nemeti
- [FOM] On a natural definition of relativistic distance of events in SRK . (Ants, elephants, and Minkowski-distance.)
Istvan Nemeti
- [FOM] Time in relativity.
Istvan Nemeti
- [FOM] Crystal Ball Theory
Steve Newberry
- [FOM] On Physical Church-Turing Thesis
Toby Ord
- [FOM] Re: The Myth of Hypercomputation
Toby Ord
- [FOM] Tien Kieu and the Quantum Adiabatic Theorem
Toby Ord
- [FOM] Re: On Physical Church-Turing Thesis
Toby Ord
- [FOM] Re: The Myth of Hypercomputation
Toby Ord
- [FOM] Re: A Newtonian computing design
Toby Ord
- [FOM] Re: FOM Digest, Vol 14, Issue 29
Robert Owen
- [FOM] Combining classical and intuitionistic features in one logic
Aarati Parmar
- [FOM] Universal but not acceptable programming systems
Brian Postow
- [FOM] Universal but not acceptable programming systems
Brian Postow
- [FOM] Historical notation question
Brian Postow
- [FOM] Workshop-Semantic Approaches to Binding Theories
Philippe Schlenker
- [FOM] French mathematician
Santo Scuderi
- [FOM] S. Barry Cooper's book "Computability Theory"
Peter Smith
- [FOM] A Newtonian computing design
Robert M. Solovay
- [FOM] The Myth of Hypercomputation
Apostolos Syropoulos
- [FOM] On Physical Church-Turing Thesis
Dmytro Taranovsky
- [FOM] Re: On Physical Church-Turing Thesis
Dmytro Taranovsky
- [FOM] Experimentation, Incompleteness, and Undecidability
Dmytro Taranovsky
- [FOM] Empirically relevant undecidability
Neil Tennant
- [FOM] Historical notation question
Neil Tennant
- [FOM] Is Chess ripe of foundational exposition/research
Alasdair Urquhart
- [FOM] Combining classical and intuitionistic features in one logic
mail at sakharov.net
- [FOM] Re: Combining classical and intuitionistic features in one logic
mail at sakharov.net
- [FOM] Historical notation question
praatika at mappi.helsinki.fi
- [FOM] Historical notation question
praatika at mappi.helsinki.fi
- [FOM] cofinite quantifier
praatika at mappi.helsinki.fi
- [FOM] Historical notation question
giovanni sambin
Last message date:
Sun Feb 29 13:49:48 EDT 2004
Archived on: Fri Mar 11 12:50:35 EDT 2005
This archive was generated by
Pipermail 0.09 (Mailman edition).