October 2007 Archives by author

• Messages sorted by: [ thread ] [ subject ] [ date ]
• More info on this list...

Starting: Mon Oct 1 08:13:44 EDT 2007
Ending: Wed Oct 31 21:49:24 EDT 2007
Messages: 188

• [FOM] IJCAR Call for Papers, and Workshop and Tutorial Proposals   by way of Martin Davis <martin at eipye.com>
• [FOM] Concerning definition of formulas   Wayne Aitken
• [FOM] Pure mathematics and humanity's collective curiosity   Andre.Rodin at ens.fr
• [FOM] Pure mathematics and humanity's collective curiosity   Andre.Rodin at ens.fr
• [FOM] Gauss and non-Euclidean geometry   Andre.Rodin at ens.fr
• [FOM] Gauss and non-Euclidean geometry   Andre.Rodin at ens.fr
• [FOM] Concerning definition of formulas   Arnon Avron
• [FOM] Concerning definition of formulas   Arnon Avron
• [FOM] A proof that cannot be formalized in ZFC   Arnon Avron
• [FOM] Concerning definition of formulas   Arnon Avron
• [FOM] paraconsistent logic and computer science   Arnon Avron
• [FOM] Dual of Dedekind-infiniteness.   Arnon Avron
• [FOM] Certainty in mathematical proofs   Arnon Avron
• [FOM] PA Incompleteness   Arnon Avron
• [FOM] Re to Sazonov about Certainty and Inquisition   Arnon Avron
• [FOM] Certainty in mathematical proofs, part 2   Arnon Avron
• [FOM] PA Incompleteness   Arnon Avron
• [FOM] Is anyone working on CH?   Arnon Avron
• [FOM] Mathematical certainty and social activity   Arnon Avron
• [FOM] Smallest universal machine   Arnon Avron
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   John Baldwin
• [FOM] paraconsistent logic and computer science   Andrej Bauer
• [FOM] Simplest universal Turing machine   Andrej Bauer
• [FOM] regular expressions   Andrej Bauer
• [FOM] Announcement: Ackermann Award 2007   Arnold Beckmann
• [FOM] Call for Nominations: Ackermann Award 2008   Arnold Beckmann
• [FOM] Pure mathematics and humanity's collective curiosity   Robert Black
• [FOM] induction and reducibility   Robert Black
• [FOM] induction and reducibility   Robert Black
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   Andreas Blass
• [FOM] Concerning definition of formulas   Alex Blum
• [FOM] Concerning definition of formulas   Alex Blum
• [FOM] Concerning definition of formulas   Alex Blum
• [FOM] A proof that cannot be formalized in ZFC   Alex Blum
• [FOM] Dual of Dedekind-infiniteness.   Alex Blum
• [FOM] Dual of Dedekind-infiniteness.   Alex Blum
• [FOM] paraconsistent logic and computer science   Alex Blum
• [FOM] Pure mathematics and humanity's collective curiosity   Alex Blum
• [FOM] Pure mathematics and humanity's collective curiosity   Alex Blum
• [FOM] Certainty in mathematical proofs   Alex Blum
• [FOM] Three quick comments.   Alex Blum
• [FOM] Mathematical certainty and social activity   Alex Blum
• [FOM] CFP: Special issue of JoLLI on hybrid logic   Thomas Bolander
• [FOM] Certainty in mathematical proofs   Andrew Boucher
• [FOM] Call for papers - CCA07 special issues   Vasco Brattka
• [FOM] Arnon Avron's reply to me   Patrick Caldon
• [FOM] Call for Participation: Henk Barndregt's 60th birthday symposium   Venanzio Capretta
• [FOM] Meeting announcement: Algorithmic Randomness Meeting at Notre Dame   Peter Cholak
• [FOM] A proof that cannot be formalized in ZFC   Timothy Y. Chow
• [FOM] Motivating the concept of a generic filter   Timothy Y. Chow
• [FOM] Motivating the concept of a generic filter   Timothy Y. Chow
• [FOM] Pure mathematics and humanity's collective curiosity   Timothy Y. Chow
• [FOM] Is anyone working on CH?   Timothy Y. Chow
• [FOM] Simplest universal Turing machine   Timothy Y. Chow
• [FOM] TAMC 2008 - Final call for papers   S B Cooper
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Francis Davey
• [FOM] Is anyone working on CH?   Martin Davis
• [FOM] question about Harvey Friedman's recent post   Martin Davis
• [FOM] Arnon Avron's reply to me   Martin Davis
• [FOM] Smallest universal machine   Martin Davis
• [FOM] The definition of universal Turing machine   Martin Davis
• [FOM] Definition of universal Turing machine   Martin Davis
• [FOM] Concerning definition of formulas   Francois G. Dorais
• [FOM] paraconsistent logic and computer science + logical context   Antonino Drago
• [FOM] Gauss and non-Euclidean geometry   Antonino Drago
• [FOM] Gauss and non-Euclidean geometry   Antonino Drago
• [FOM] non-Euclidean geometry and FOM programs   Antonino Drago
• [FOM] Two questions on Set Theory   Adrian-Sorin Duma
• [FOM] A proof that cannot be formalized in ZFC   Kenny Easwaran
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Steven Ericsson-Zenith
• [FOM] Concerning definition of formulas   Thomas Forster
• [FOM] Concerning definition of formulas   Thomas Forster
• [FOM] Pure mathematics and humanity's collective curiosity   Thomas Forster
• [FOM] induction and reducibility   Thomas Forster
• [FOM] book draft available   Harvey Friedman
• [FOM] PA Incompleteness   Harvey Friedman
• [FOM] PA Incompleteness   Harvey Friedman
• [FOM] complexity of open questions   Harvey Friedman
• [FOM] PA Incompleteness   Harvey Friedman
• [FOM] Certainty in mathematical proofs   Harvey Friedman
• [FOM] 309: Thematic PA Incompleteness   Harvey Friedman
• [FOM] question about universality for prize   Harvey Friedman
• [FOM] Concerning definition of formulas   Andy Fugard
• [FOM] regular expressions   Olivier Gerard
• [FOM] Fwd: Concerning definition of formulas   Kaveh Ghasemloo
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Rob van Glabbeek
• [FOM] Wolfram 2,3 Turing Machine Prize   Wolfram Science Group
• [FOM] induction and reducibility   Allen Hazen
• [FOM] Concerning definition of formulas   Richard Heck
• [FOM] A proof that cannot be formalized in ZFC   Richard Heck
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   James Hirschorn
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   James Hirschorn
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   James Hirschorn
• [FOM] Pure mathematics and humanity's collective curiosity   Adib Ben Jebara
• [FOM] Concerning definition of formulas   Roger Bishop Jones
• [FOM] regular expressions   Adam Kolany
• [FOM] Gauss and non-Euclidean geometry   S. S. Kutateladze
• [FOM] Gauss and non-Euclidean geometry   S. S. Kutateladze
• [FOM] Gauss and non-Euclidean geometry   S. S. Kutateladze
• [FOM] Gauss and non-Euclidean geometry   S. S. Kutateladze
• [FOM] Gauss and non-Euclidean geometry   S. S. Kutateladze
• [FOM] non-Euclidean geometry and FOM programs   S. S. Kutateladze
• [FOM] A proof that cannot be formalized in ZFC   Finnur Larusson
• [FOM] Concerning definition of formulas   John McCarthy
• [FOM] Pure mathematics and humanity's collective curiosity   John McCarthy
• [FOM] Pure mathematics and humanity's collective curiosity   John McCarthy
• [FOM] Arnon Avron's reply to me   John McCarthy
• [FOM] Simplest universal Turing machine   John McCarthy
• [FOM] Simplest universal Turing machine   John McCarthy
• [FOM] Simplest universal Turing machine   Wojtek Moczydlowski
• [FOM] A proof that cannot be formalized in ZFC   Marcin Mostowski
• [FOM] regular expressions   Marcin Mostowski
• [FOM] induction and reducibility   A J Franco de Oliveira
• [FOM] Concerning definition of formulas   Vaughan Pratt
• [FOM] Concerning definition of formulas   Vaughan Pratt
• [FOM] Dual of Dedekind-infiniteness.   Vaughan Pratt
• [FOM] Concerning definition of formulas   Vaughan Pratt
• [FOM] Concerning definition of formulas   Vaughan Pratt
• [FOM] feasibility (was PA Incompleteness)   Vaughan Pratt
• [FOM] Certainty in mathematical proofs, part 2   Vaughan Pratt
• [FOM] Three quick comments.   Vaughan Pratt
• [FOM] Simplest universal Turing machine   Vaughan Pratt
• [FOM] Smallest universal machine   Vaughan Pratt
• [FOM] Simplest universal Turing machine   Vaughan Pratt
• [FOM] Definition of universal Turing machine   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Vaughan Pratt
• [FOM] Smallest universal machine   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Vaughan Pratt
• [FOM] regular expressions   Vaughan Pratt
• [FOM] regular expressions   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Todd Rowland
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Todd Rowland
• [FOM] Concerning definition of formulas   Vladimir Sazonov
• [FOM] paraconsistent logic and computer science   Vladimir Sazonov
• [FOM] feasibility (was PA Incompleteness)   Vladimir Sazonov
• [FOM] Feasibility   Vladimir Sazonov
• [FOM] Certainty in mathematical proofs   Vladimir Sazonov
• [FOM] to Sazonov about Certainty and Inquisition   Vladimir Sazonov
• [FOM] Certainty in mathematical proofs, part 2   Vladimir Sazonov
• [FOM] paraconsistent logic and computer science   Hartley Slater
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Alexander Smith
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Alexander Smith
• [FOM] Concerning definition of formulas   B. Sidney Smith
• [FOM] Concerning definition of formulas   B. Sidney Smith
• [FOM] Dual of Dedekind-infiniteness.   Larry Stout
• [FOM] Dual of Dedekind-infiniteness.   Lawrence Stout
• [FOM] Motivating the concept of a generic filter   Jay Sulzberger
• [FOM] Motivating the concept of a generic filter   Jay Sulzberger
• [FOM] Simplest universal Turing machine   Jay Sulzberger
• [FOM] Wolfram 2,3 Turing Machine Prize   Apostolos Syropoulos
• [FOM] Dual of Dedekind-infiniteness.   Bill Taylor
• [FOM] Pure mathematics and humanity's collective curiosity   Bill Taylor
• [FOM] Three quick comments.   Bill Taylor
• [FOM] Three quick comments.   Bill Taylor
• [FOM] Wolfram 2,3 Turing Machine Prize   Bill Taylor
• [FOM] ESSLLI 2008 (European Summer School in Logic, Language and Information), Hamburg (Germany), 4-15 August 2008   Sara L. Uckelman
• [FOM] Pure mathematics and humanity's collective curiosity   Alasdair Urquhart
• [FOM] Gauss and non-Euclidean geometry   Alasdair Urquhart
• [FOM] Gauss and non-Euclidean geometry   Alasdair Urquhart
• [FOM] Smallest universal machine   Alasdair Urquhart
• [FOM] induction and reducibility   Joseph Vidal-Rosset
• [FOM] Gauss and non-Euclidean geometry   Vladimir.Sazonov at liverpool.ac.uk
• [FOM] Gauss and non-Euclidean geometry   Vladimir.Sazonov at liverpool.ac.uk
• [FOM] PA Incompleteness   Frank Waaldijk
• [FOM] key terms in logic   Jon Williamson
• [FOM] The Reasoner 1(7) now available   Jon Williamson
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Stephen Wolfram
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Damien Woods
• [FOM] PA Incompleteness   Feng Ye
• [FOM] Pure mathematics and humanity's collective curiosity   Feng Ye
• [FOM] Smallest universal machine   Hector Zenil
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Hector Zenil
• [FOM] PA Incompleteness   bjstande at artsci.wustl.edu
• [FOM] Is anyone working on CH?   joeshipman at aol.com
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   joeshipman at aol.com
• [FOM] Simplest universal Turing machine   joeshipman at aol.com
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   joeshipman at aol.com
• [FOM] Simplest universal Turing machine   joeshipman at aol.com
• [FOM] Definition of universal Turing machine   joeshipman at aol.com
• [FOM] Does 2^{\aleph_0} = 2^{\aleph_1}?   joeshipman at aol.com
• [FOM] Simple Turing machines, Universality, Encodings, etc.   joeshipman at aol.com
• [FOM] Simple Turing machines, Universality, Encodings, etc.   joeshipman at aol.com
• [FOM] Gauss and non-Euclidean geometry   josef at us.es
• [FOM] A proof that cannot be formalized in ZFC   laureano luna
• [FOM] Call for Papers: Formal ontology & applications   daniele radicioni
• [FOM] Mathematical certainty and social activity   ravi
• [FOM] Pure mathematics and humanity's collective curiosity   andre rodin

Last message date: Wed Oct 31 21:49:24 EDT 2007
Archived on: Thu Nov 1 14:25:38 EDT 2007

• Messages sorted by: [ thread ] [ subject ] [ date ]
• More info on this list...