Skip to main content
SpringerLink
Log in

Large-Scale Organizational Computing Requires Unstratified Reflection and Strong Paraconsistency

  • Conference paper
Coordination, Organizations, Institutions, and Norms in Agent Systems III (COIN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4870))

Abstract

Organizational Computing is a computational model for using the principles, practices, and methods of human organizations. Organizations of Restricted Generality (ORGs) have been proposed as a foundation for Organizational Computing. ORGs are the natural extension of Web Services, which are rapidly becoming the overwhelming standard for distributed computing and application interoperability in Organizational Computing. The thesis of this paper is that large-scale Organizational Computing requires reflection and strong paraconsistency for organizational practices, policies, and norms.

Strong paraconsistency is required because the practices, policies, and norms of large-scale Organizational Computing are pervasively inconsistent. By the standard rules of logic, anything and everything can be inferred from an inconsistency, e.g., “The moon is made of green cheese.” The purpose of strongly paraconsistent logic is to develop principles of reasoning so that irrelevances cannot be inferred from the fact of inconsistency while preserving all natural inferences that do not explode in the face of inconsistency.

Reflection is required in order that the practices, policies, and norms can mutually refer to each other and make inferences. Reflection and strong paraconsistency are important properties of Direct Logic [Hewitt 2007] for large software systems. Gödel first formalized and proved that it is not possible to decide all mathematical questions by inference in his 1st incompleteness theorem. However, the incompleteness theorem (as generalized by Rosser) relies on the assumption of consistency! This paper proves a generalization of the Gödel/Rosser incompleteness theorem: theories of Direct Logic are incomplete. However, there is a further consequence. Although the semi-classical mathematical fragment of Direct Logic is evidently consistent, since the Gödelian paradoxical proposition is self-provable, every theory in Direct Logic has an inconsistency!

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Agha, G., Mason, I., Smith, S., Talcott, C.: A foundation for Actor computation. Journal of Functional Programming (1997)

    Google Scholar 

  • Besnard, P., Hunter, A.: Quasi-classical Logic: Non-trivializable classical reasoning from inconsistent information. Symbolic and Quantitative Approaches to Reasoning and Uncertainty (1995)

    Google Scholar 

  • Bowker, G., Star, S.L., Turner, W., Gasser, L. (eds.): Social Science Research, Technical Systems and Cooperative Work. Lawrence Earlbaum (1997)

    Google Scholar 

  • Carnap, R.: Logische Syntax der Sprache (The Logical Syntax of Language Open Court Publishing 2003) (1934)

    Google Scholar 

  • Cellucci, C.: “Gödel’s Incompleteness Theorem and the Philosophy of Open Systems” Kurt Gödel: Actes du Colloque, Neuchâtel 13-14 juin 1991, Travaux de logique N. 7, Centre de Recherches Sémiologiques, Université de Neuchâtel. (1992), http://w3.uniroma1.it/cellucci/documents/Goedel.pdf

  • Dahl, O.-J., Nygaard, K.: Class and subclass declarations. IFIP TC2 (May 1967)

    Google Scholar 

  • Feferman, S.: Toward Useful Type-Free Theories, I. In: Martin, R. (ed.) Recent Essays on Truth and the Liar Paradox, Claraendon Press (1984a)

    Google Scholar 

  • Feferman, S.: Kurt Gödel: Conviction and Caution. Philosophia Naturalis 21 (1984b)

    Google Scholar 

  • Feferman, S.: Axioms for determinateness and truth (2007a), http://math.stanford.edu/~feferman/papers.html

  • Feferman, S.: Gödel, Nagel, minds and machines (October 25, 2007), (2007b), http://math.stanford.edu/~feferman/papers/godelnagel.pdf

  • Gödel, K.: On formally undecidable propositions of Principia Mathematica translated by Bernard Meltzer. Basic Books (1962). Monatshefte für Mathematik und Physik, vol. 38, pp. 173–198 (1931)

    Google Scholar 

  • Hewitt, C., Bishop, P., Steiger, R.: A Universal Modular Actor Formalism for Artificial Intelligence. IJCAI (1973)

    Google Scholar 

  • Hewitt, C., Inman, J.: DAI Betwixt and Between: From ‘Intelligent Agents’ to Open Systems Science. IEEE Transactions on Systems, Man, and Cybernetics (November/December 1991)

    Google Scholar 

  • Hewitt, C.: The repeated demise of logic programming and why it will be reincarnated. What Went Wrong and Why (2006a). Technical Report SS-06-08 (March 2006)

    Google Scholar 

  • Hewitt, C.: What is Commitment? Physical, Organizational, and Social. In: Noriega, P., Vázquez-Salceda, J., Boella, G., Boissier, O., Dignum, V., Fornara, N., Matson, E. (eds.) COIN 2006. LNCS (LNAI), vol. 4386, pp. 293–307. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  • Hewitt, C.: Organizational Computing Requires Unstratified Paraconsistency and Reflection. COIN@AAMAS, 2007 (2007a)

    Google Scholar 

  • Hewitt, C.: The Downfall of Mental Agents in the Implementation of Large Software Systems. AAAI Magazine issue on What went wrong and why, 2007 (2007b)

    Google Scholar 

  • Hewitt, C.: Common sense for concurrency and strong paraconsistency using unstratified inference and reflection. Submitted for publication to AI Journal special issue on Common Sense, 2007 (2007c)

    Google Scholar 

  • Jennings, N.: Commitments and conventions: The foundation of coordination in multi-agent systems. Knowledge Engineering Review 3 (1993)

    Google Scholar 

  • Ketonen, J., Weyhrauch, R.: A decidable fragment of Predicate Calculus. Theoretical Computer Science (1984)

    Google Scholar 

  • Kornfeld, B., Hewitt, C.: The Scientific Community Metaphor. IEEE Transactions on Systems, Man, and Cybernetics (January 1981)

    Google Scholar 

  • Lakatos, I. (1967). A renaissance of empiricism in the recent philosophy of mathematics? Mathematics, Science and Epistemology (1978)

    Google Scholar 

  • Leitgeb, H.: What theories of truth should be like (but cannot be). Philosophy Compass 2(2)

    Google Scholar 

  • Löb, M.: Solution of a problem of Leon Henkin. Journal of Symbolic Logic 20 (1955)

    Google Scholar 

  • McGee, V.: In Praise of the Free Lunch: Why Disquotationalists Should Embrace Compositional Semantics. Self-Reference. CSLI Publications (2006)

    Google Scholar 

  • Noriega, P.: Agent Mediated Auctions: The Fishmarket Metaphor. Ph.D., Barcelona (1997)

    Google Scholar 

  • Priest, G.: 60% Proof: Lakatos, Proof, and Paraconsistency (2006), http://garnet.acns.fsu.edu/~tan02/OPC%20Week%20Three/Priest.pdf

  • Priest, G., Tanaka, K.: Paraconsistent Logic. The Stanford Encyclopedia of Philosophy. Winter (2004)

    Google Scholar 

  • Restall, G.: Curry’s Revenge: the costs of non-classical solutions to the paradoxes of self-reference (to appear in The Revenge of the Liar, Beall, J.C (Ed.) Oxford University Press, 2007) (July 12, 2006)

    Google Scholar 

  • Rosenberg, S.: Dreaming in code. Crown Publishing (2007)

    Google Scholar 

  • Rosser, J.B.: Extensions of Some Theorems of Gödel and Church. Journal of Symbolic. Logic 1(3) (1936)

    Google Scholar 

  • Routley, R.: Dialectical Logic, Semantics and Metamathematics. Erkenntnis 14 (1979)

    Google Scholar 

  • Shankar, N.: Metamathematics, Machines, and Gödel’s Proof. Cambridge University Press, Cambridge (1994)

    MATH  Google Scholar 

  • Shapiro, S.: Lakatos and logic Comments on Graham Priest’s ‘60% proof: Lakatos, proof, and paraconsistency’. (Preprint, 2006), http://garnet.acns.fsu.edu/~tan02/OPC%20Week%20Three/Commentary%20on%20Priest.pdf#search=%22paraconsistency%202006%20filetype%3Apdf%22

  • Sieg, W., Field, C.: Automated search for Gödel proofs. Annals of Pure and Applied Logic (2005)

    Google Scholar 

  • Singh, M., Huhns, M.: Service-Oriented Computing: Semantics, Processes, Agents. John Wiley & Sons, Chichester (2005)

    Google Scholar 

  • Tarski, A.: The semantic conception of truth and the foundations of semantics. Philosophy and Phenomenological Research 4 (Reprinted in Readings in Philosophical Analysis, Appleton-1944) (1944)

    Google Scholar 

  • Tarski, A., Vaught, R.: Arithmetical extensions of relational systems. Compositio Mathematica 13 (1957)

    Google Scholar 

  • Wooldridge, M.: Reasoning about Rational Agents. MIT Press (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT EECS (Emeritus),  

    Carl Hewitt

Authors
  1. Carl Hewitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaime Simão Sichman Julian Padget Sascha Ossowski Pablo Noriega

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hewitt, C. (2008). Large-Scale Organizational Computing Requires Unstratified Reflection and Strong Paraconsistency. In: Sichman, J.S., Padget, J., Ossowski, S., Noriega, P. (eds) Coordination, Organizations, Institutions, and Norms in Agent Systems III. COIN 2007. Lecture Notes in Computer Science(), vol 4870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79003-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79003-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79002-0

  • Online ISBN: 978-3-540-79003-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation