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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Arthur, W. B.: 1994, ‘Inductive Reasoning and Bounded Rationality’, Complexity in Economic Theory 84, 406–411.
Aumann, R.: 1976, ‘Agreeing to Disagree’, Annals of Statistics 4, 1236–1239.
Benoit, J. P.: 1999, ‘Strategy Proofness and when Ties are Permitted’, research report, Economics Department, NYU.
Benthem, Johan van: to appear, ‘Logic and Procedure in Legal Reasoning’.
Benthem, Johan van: to appear, ‘When are Two Games the Same?’, Presented at LOFT-3, Torino, 1998.
Bicchieri, Cristina: 1984, Rationality and Coordination, Cambridge University Press.
Brams S.: 1994, Theory of Moves, Cambridge University Press.
Brams, S. and A. Taylor: 1996, Fair Division, Cambridge University Press.
Brams, S. and P. Fishburn: to appear, ‘Voting Procedures’, in Arrow et al. (eds), Handbook of Social Choice and Welfare, Elsevier.
Brandenburger, A. and J. Keisler: 1999, ‘An Impossibility Theorem on Beliefs in Games’.
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.
Chwe, M.: 2001, Rational Ritual: Culture, Coordination and Common Knowledge, Princeton University Press.
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.
Dummett, M. A. E.: 1997, Principles of Electoral Reform, Oxford University Press.
Fagin, R., J. Halpern, Y. Moses, and M. Vardi: 1995, Reasoning about Knowledge,MIT Press, Cambridge, MA.
Geanakoplos, J. and H. Polemarchakis: 1982, ‘We Can’t Disagree Forever’, J. Economic Theory 28, 192–200.
Gibbard, A.: 1973, ‘Manipulation of Voting Schemes: A General Result’, Econometrica 41, 587–601.
Greenwald, A., B. Mishra, and R. Parikh: 1998, ‘The Santa Fe Bar Problem Revisited’, presented at the Stony Brook workshop on Game Theory.
Hintikka, J.: 1962, Knowledge and Belief, Cornell University Press.
Kozen, D. and R. Parikh: 1981, ‘An Elementary Completeness Proof for PDL’, Theor. Comp. Sci. 14, 113–118.
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.
Lewis, D.: 1969, Convention: A Philosophical Study, Harvard University Press.
Moore, J.: 1992, ‘Implementation, Contracts, and Renegotitation in Environments with Complete Information’, in Advances in Economic Theory, Sixth World Congress, Cambridge University Press.
Parikh, R.: 2000, ‘Communication, Meaning, and Interpretation’, Linguistics and Philosophy 23(2), 185–212.
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.
Parikh, R.: 1985, ‘The Logic of Games and its Applications’, Annals of Discrete Math. 24, 111–140.
Parikh, R.: 1994, ‘Vagueness and Utility: The Semantics of Common Nouns’, Linguistics and Philosophy 17, 521–535.
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.
Parikh, R. and P. Krasucki: 1990, ‘Communication, Consensus and Knowledge’, J. Economic Theory 52, 178–189.
Parikh, R., L. Parida and V. Pratt: 2001, ‘Sock Sorting: An Example of a Vague Algorithm’, to appear in Logic J. IGPL.
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.
Pauly, M.: 19??, ‘An Introduction to Game Logic’, in Fromalizing the Dynamics of Information Flow.
Pauly, M.: to appear, ‘A Modal Logic for Coalitional Power in Games’.
Pratt, V.: 1976, ‘Semantical Considerations in Floyd-Hoare Logic’, in Proceedings 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 109–121.
Satterthwaite, M.: 1975, ‘Strategy-Proofness and Arrow’s Conditions’, J. Economic Theory 10, 187–217.
Wittgenstein, L.: 1953, Philosophical Investigations, Tranlsated by G.E.M.Anscombe, Basil Blackwell.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Parikh, R. Social Software. Synthese 132, 187–211 (2002). https://doi.org/10.1023/A:1020391420768
Issue Date:
DOI: https://doi.org/10.1023/A:1020391420768