May 2020 Archives by author
Starting: Fri May 1 05:44:06 EDT 2020
Ending: Tue May 26 07:45:03 EDT 2020
Messages: 55
- Questions on proof assistants
Christoph Benzmueller
- Questions on proof assistants
Frédéric Blanqui
- Questions on proof assistants
Ingo Blechschmidt
- Question about AC
Ingo Blechschmidt
- Questions on proof assistants
Hendrik Boom
- Job offer for a Mathematician or Computer Scientist researcher in Barcelona
Ana Borges
- Questions on proof assistants
Buzzard, Kevin M
- Mathematical results related to the heuristic Principle of Computational Equivalence
José Manuel Rodríguez Caballero
- Questions on proof assistants
José Manuel Rodríguez Caballero
- Questions on proof assistants
Mario Carneiro
- Questions on proof assistants
Timothy Y. Chow
- Questions on proof assistants
Timothy Y. Chow
- "Insignificant Choice Polynomial Time" -- P != NP
Timothy Y. Chow
- WFLP 2020 CFP (Workshop on Functional and Constraint Logic Programming)
Claudio Sacerdoti Coen
- Question about AC
Patrik Eklund
- 853: Embedded Maximality (revisited)/1
Harvey Friedman
- Concerning Computational Equivalence Ideas
Harvey Friedman
- 854: Lower R Invariant Maximal Sets/1
Harvey Friedman
- 855: Lower Equivalent and Stable Maximal Sets/1
Harvey Friedman
- Questions on proof assistants
Qian Hong
- Submission for [FOM]
Peter Koepke
- Mathematical results related to the heuristic Principle of Computational Equivalence
Kreinovich, Vladik
- "Insignificant Choice Polynomial Time" -- P != NP
Serguei Mokhov
- New volume on Term functors, Ultrafilter categoriical computing, and Monads
Dr. Cyrus F Nourani
- Questions on proof assistants
Lawrence Paulson
- Questions on proof assistants
Lawrence Paulson
- Questions on proof assistants
Prof. Julian Rohrhuber
- Final call for contributions for the virtual WiL 2020 (4th Women in Logic Worskhop collocated with Petri Nets, IJCAR etc)
Rozman, Mihaela
- 6-year PostDoc Position in Algorithms at the Vienna University of Technology (TU Wien), Vienna, Austria *** Application deadline is May 28, 2020 ***
Rozman, Mihaela
- Several Open PhD Positions in the doctoral program on Logical Methods in Computer Science (LogiCS) in Austria ***Deadline: June 12, 2020***
Rozman, Mihaela
- Fully funded PhD in Networking and Communication Technology at the University of Vienna, Austria ***Deadline: June 7, 2020***
Rozman, Mihaela
- Mathematical results related to the heuristic Principle of Computational Equivalence
Joe Shipman
- Questions on proof assistants
Joe Shipman
- Question about AC
Joe Shipman
- Question about AC
Joe Shipman
- Question about AC
Joe Shipman
- Question about AC
Joe Shipman
- Mathematical results related to the heuristic Principle of Computational Equivalence
Mitchell Spector
- S.I. Adian memorial conference (May 26–27, 2020, online, Moscow)
Stanislav Speranski
- Continuity, Computability, Constructivity 2020; call for submissions
Dieter Spreen
- "Insignificant Choice Polynomial Time" -- P != NP
Lukasz T. Stepien
- Update on ordinal analysis
Dmytro Taranovsky
- Questions on proof assistants
Joseph Vidal-Rosset
- Questions on proof assistants
Freek Wiedijk
- Questions on proof assistants
Freek Wiedijk
- [FOM] Re: Questions on proof assistants
Wolfgang Windsteiger
- unprovability of consistency of a smaller theory
martdowd at aol.com
- SQUARE'2020 - Leuven - Extended Deadline May 31
jean-yves beziau
- Questions on proof assistants
mario chiari
- PhD studentships, Birmingham UK
anupamdotdas at gmail.com
- Postdoc in Proof Theory - University of Birmingham, UK.
anupamdotdas at gmail.com
- CfP: Workshop NETREASON @ ECAI20
gprimiero at libero.it
- Questions on proof assistants
dennis at logicalphalluses.net
- Question about AC
katzmik at macs.biu.ac.il
- Question about AC
katzmik at macs.biu.ac.il
Last message date:
Tue May 26 07:45:03 EDT 2020
Archived on: Tue May 26 14:17:08 EDT 2020
This archive was generated by
Pipermail 0.09 (Mailman edition).