Advertisement

Synthese

, Volume 132, Issue 3, pp 187–211 | Cite as

Social Software

  • Rohit Parikh
Article

Abstract

We suggest that the issue of constructing andverifying social procedures, which we suggestively call socialsoftware, be pursued as systematically as computer software is pursued by computer scientists. Certain complications do arise withsocial software which do not arise with computer software, but thesimilarities are nonetheless strong, and tools already exist which wouldenable us to start work on this important project. We give a variety ofsuggestive examples and indicate some theoretical work which alreadyexists.

Keywords

Computer Scientist Theoretical Work Social Software Important Project Social Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. Arthur, W. B.: 1994, ‘Inductive Reasoning and Bounded Rationality’, Complexity in Economic Theory 84, 406–411.Google Scholar
  2. Aumann, R.: 1976, ‘Agreeing to Disagree’, Annals of Statistics 4, 1236–1239.Google Scholar
  3. Benoit, J. P.: 1999, ‘Strategy Proofness and when Ties are Permitted’, research report, Economics Department, NYU.Google Scholar
  4. Benthem, Johan van: to appear, ‘Logic and Procedure in Legal Reasoning’.Google Scholar
  5. Benthem, Johan van: to appear, ‘When are Two Games the Same?’, Presented at LOFT-3, Torino, 1998.Google Scholar
  6. Bicchieri, Cristina: 1984, Rationality and Coordination, Cambridge University Press.Google Scholar
  7. Brams S.: 1994, Theory of Moves, Cambridge University Press.Google Scholar
  8. Brams, S. and A. Taylor: 1996, Fair Division, Cambridge University Press.Google Scholar
  9. Brams, S. and P. Fishburn: to appear, ‘Voting Procedures’, in Arrow et al. (eds), Handbook of Social Choice and Welfare, Elsevier.Google Scholar
  10. Brandenburger, A. and J. Keisler: 1999, ‘An Impossibility Theorem on Beliefs in Games’.Google Scholar
  11. Chopra, C. and R. Parikh: 19??, ‘An Inconsistency Tolerant Model for Belief Representation and Belief Revision’, appeared in Proceedings IJCAI 99. Full version to appear in Annals of Math and AI.Google Scholar
  12. Chwe, M.: 2001, Rational Ritual: Culture, Coordination and Common Knowledge, Princeton University Press.Google Scholar
  13. Cousot, P.: 1990, ‘Methods and Logics for Proving Programs’, in J. V. Leeuwen (eds), Handbook of Theoretical Computer Science, Vol B, North-Holland, Amsterdam, pp. 841–994.Google Scholar
  14. Dummett, M. A. E.: 1997, Principles of Electoral Reform, Oxford University Press.Google Scholar
  15. Fagin, R., J. Halpern, Y. Moses, and M. Vardi: 1995, Reasoning about Knowledge,MIT Press, Cambridge, MA.Google Scholar
  16. Geanakoplos, J. and H. Polemarchakis: 1982, ‘We Can’t Disagree Forever’, J. Economic Theory 28, 192–200.Google Scholar
  17. Gibbard, A.: 1973, ‘Manipulation of Voting Schemes: A General Result’, Econometrica 41, 587–601.Google Scholar
  18. Greenwald, A., B. Mishra, and R. Parikh: 1998, ‘The Santa Fe Bar Problem Revisited’, presented at the Stony Brook workshop on Game Theory.Google Scholar
  19. Hintikka, J.: 1962, Knowledge and Belief, Cornell University Press.Google Scholar
  20. Kozen, D. and R. Parikh: 1981, ‘An Elementary Completeness Proof for PDL’, Theor. Comp. Sci. 14, 113–118.Google Scholar
  21. Kozen, D. and J. Tiuryn: 1990, ‘Logics of Programs’, in J.V. Leeuwen, (ed.), Handbook of Theoretical Computer Science, Vol B, North-Holland, Amsterdam, pp. 789–840.Google Scholar
  22. Lewis, D.: 1969, Convention: A Philosophical Study, Harvard University Press.Google Scholar
  23. Moore, J.: 1992, ‘Implementation, Contracts, and Renegotitation in Environments with Complete Information’, in Advances in Economic Theory, Sixth World Congress, Cambridge University Press.Google Scholar
  24. Parikh, R.: 2000, ‘Communication, Meaning, and Interpretation’, Linguistics and Philosophy 23(2), 185–212.Google Scholar
  25. Parikh, R.: ‘Propositional Logics of Programs: New Directions’, in Mark Karpinski (ed.), Foundations of Computation Theory, Springer Lecture Notes in Computer Science #158 (1983) pp. 347–359.Google Scholar
  26. Parikh, R.: 1985, ‘The Logic of Games and its Applications’, Annals of Discrete Math. 24, 111–140.Google Scholar
  27. Parikh, R.: 1994, ‘Vagueness and Utility: The Semantics of Common Nouns’, Linguistics and Philosophy 17, 521–535.Google Scholar
  28. Parikh, R.: 1995, 2001, ‘Language as Social Software, (Abstract)’, International Congress on Logic, Methodology and Philosophy of Science, p. 417. Full paper in J. Floyd and S. Shieh (eds), Future Pasts: the Analytic Tradition in Twentieth Century Philosophy, Oxford University Press, 2001, pp. 339-350.Google Scholar
  29. Parikh, R. and P. Krasucki: 1990, ‘Communication, Consensus and Knowledge’, J. Economic Theory 52, 178–189.Google Scholar
  30. Parikh, R., L. Parida and V. Pratt: 2001, ‘Sock Sorting: An Example of a Vague Algorithm’, to appear in Logic J. IGPL.Google Scholar
  31. Parikh, R. and R. Ramanujam: 1985, ‘Distributed Processing and the Logic of Knowledge’, in Logics of Programs, Proceedings of a Conference at Brooklyn College, Springer Lecture Notes in Computer Science #193.Google Scholar
  32. Pauly, M.: 19??, ‘An Introduction to Game Logic’, in Fromalizing the Dynamics of Information Flow.Google Scholar
  33. Pauly, M.: to appear, ‘A Modal Logic for Coalitional Power in Games’.Google Scholar
  34. Pratt, V.: 1976, ‘Semantical Considerations in Floyd-Hoare Logic’, in Proceedings 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 109–121.Google Scholar
  35. Satterthwaite, M.: 1975, ‘Strategy-Proofness and Arrow’s Conditions’, J. Economic Theory 10, 187–217.Google Scholar
  36. Wittgenstein, L.: 1953, Philosophical Investigations, Tranlsated by G.E.M.Anscombe, Basil Blackwell.Google Scholar
  37. Wittgenstein, L.: 1978, in G. H. von Wright, R. Rhees and G. E. M. Anscombe (eds), Remarks on the Foundations of Mathematics, MIT Press, Cambridge, MA.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Rohit Parikh
    • 1
  1. 1.Departments of Computer Science, Mathematics and Philosophy CUNY Graduate CenterCity University of New YorkUSA

Personalised recommendations