Sciweavers

25 search results - page 2 / 5
» Simple structures axiomatized by almost sure theories
Sort
View
LPAR
2010
Springer
13 years 3 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
Michael Gabbay, Murdoch James Gabbay
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
RTA
2005
Springer
13 years 10 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
PPDP
2000
Springer
13 years 9 months ago
Symmetric monoidal sketches
We introduce and develop the notion of symmetric monoidal sketch. Every symmetric monoidal sketch generates a generic model. If the sketch is commutative and single-sorted, the gen...
Martin Hyland, John Power
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 7 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner