Metalogic

Results: 681



#Item
51Scribe Notes: Game Theory in Formal Verification, Krishnendu Chatterjee  Lecture 3 Matthias F¨ ugger,  March 25, 2010

Scribe Notes: Game Theory in Formal Verification, Krishnendu Chatterjee Lecture 3 Matthias F¨ ugger, March 25, 2010

Add to Reading List

Source URL: pub.ist.ac.at

Language: English - Date: 2010-03-25 12:26:50
52Concurrency Makes Simple Theories Hard Stefan Göller1 and Anthony Widjaja Lin2 1 2  Fachbereich Informatik, University of Bremen, Germany

Concurrency Makes Simple Theories Hard Stefan Göller1 and Anthony Widjaja Lin2 1 2 Fachbereich Informatik, University of Bremen, Germany

Add to Reading List

Source URL: www.informatik.uni-bremen.de

Language: English - Date: 2012-02-03 05:33:40
53Completeness Results for Memory Logics Carlos Arecesa , Santiago Figueirab,c , Sergio Merab,1 a INRIA Nancy Grand Est, France de Computaci´

Completeness Results for Memory Logics Carlos Arecesa , Santiago Figueirab,c , Sergio Merab,1 a INRIA Nancy Grand Est, France de Computaci´

Add to Reading List

Source URL: www.glyc.dc.uba.ar

Language: English - Date: 2012-08-27 11:06:28
54Topology in distributed computing Final project: black box x-consensus  objects

Topology in distributed computing Final project: black box x-consensus objects

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-08-03 17:19:31
55COMMUNICATION WITH MULTIPLE SENDERS: AN EXPERIMENT EMANUEL VESPA AND ALISTAIR J. WILSON A BSTRACT. We implement multi-sender cheap talk in the laboratory. While full-information transmission is not theoretically feasible

COMMUNICATION WITH MULTIPLE SENDERS: AN EXPERIMENT EMANUEL VESPA AND ALISTAIR J. WILSON A BSTRACT. We implement multi-sender cheap talk in the laboratory. While full-information transmission is not theoretically feasible

Add to Reading List

Source URL: www.qeconomics.org

Language: English - Date: 2015-07-10 14:34:53
56Scott Domains in Abstract Stone Duality Paul Taylor August 5, 2003 Abstract Identifying the need for Scott domains to be overt (open) objects in intuitionistic locale theory, we re-work Scott’s informations systems con

Scott Domains in Abstract Stone Duality Paul Taylor August 5, 2003 Abstract Identifying the need for Scott domains to be overt (open) objects in intuitionistic locale theory, we re-work Scott’s informations systems con

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 13:08:48
57Scribe Notes: Game Theory in Formal Verification, Krishnendu Chatterjee  Lecture 2 Heinrich Moser,   March 12, 2010

Scribe Notes: Game Theory in Formal Verification, Krishnendu Chatterjee Lecture 2 Heinrich Moser, March 12, 2010

Add to Reading List

Source URL: pub.ist.ac.at

Language: English - Date: 2010-03-12 05:03:34
58Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies Santiago Figueira  Daniel Gor´ın

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies Santiago Figueira Daniel Gor´ın

Add to Reading List

Source URL: www.glyc.dc.uba.ar

Language: English - Date: 2013-08-19 18:50:17
59CMCSInfinitary Howe’s Method Paul Blain Levy  1

CMCSInfinitary Howe’s Method Paul Blain Levy 1

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2007-05-03 10:47:17
60MFPSExploratory functions on nondeterministic strategies, up to lower bisimilarity ? Paul Blain Levy1 Kidane Yemane Weldemariam2 University of Birmingham, Birmingham, B15 2TT, UK

MFPSExploratory functions on nondeterministic strategies, up to lower bisimilarity ? Paul Blain Levy1 Kidane Yemane Weldemariam2 University of Birmingham, Birmingham, B15 2TT, UK

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2009-05-18 06:36:21