From Domains Towards a Logic of Universals: A Small Calculus for the Continuous Determination of Worlds
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
At the end of the 19th century, 'logic' moved from the discipline of philosophy to that of mathematics. One hundred years later, we have a plethora of formal logics. Looking at the situation form informatics, the mathematical discipline proved only a temporary shelter for `logic'. For there is Domain Theory, a constructive mathematical theory which extends the notion of computability into the continuum and spans the field of all possible deductive systems. Domain Theory describes the space of data-types which computers can ideally compute -- and computation in terms of these types. Domain Theory is constructive but only potentially operational. Here one particular operational model is derived from Domain Theory which consists of `universals', that is, model independent operands and operators. With these universals, Domains (logical models) can be approximated and continuously determined. The universal data-types and rules derived from Domain Theory relate strongly to the first formal logic conceived on philosophical grounds, Aristotelian (categorical) logic. This is no accident. For Aristotle, deduction was type-dependent and he too thought in term of type independent universal `essences'. This paper initiates the next `logical' step `beyond' Domain Theory by reconnecting `formal logic' with its origin
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Aarne Ranta (1998). Syntactic Calculus with Dependent Types. Journal of Logic, Language and Information 7 (4):413-431.
Solomon Feferman (1999). Logic, Logics, and Logicism. Notre Dame Journal of Formal Logic 40 (1):31-54.
Steve Awodey, Lars Birkedal & Dana Scott, Local Realizability Toposes and a Modal Logic for Computability.
Lawrence C. Paulson (1987). Logic and Computation: Interactive Proof with Cambridge Lcf. Cambridge University Press.
Andrew Aberdein (2006). Managing Informal Mathematical Knowledge: Techniques From Informal Logic. Lecture Notes in Artificial Intelligence 4108:208--221.
Wilfrid Hodges (ed.) (1996). Logic: From Foundation to Applications: European Logic Colloquium. Oxford University Press.
Fairouz Kamareddine, Twan Laan & Rob Nederpelt (2002). Types in Logic and Mathematics Before 1940. Bulletin of Symbolic Logic 8 (2):185-245.
Kevin de Laplante, Certainty and Domain-Independence in the Sciences of Complexity: A Critique of James Franklin's Account of Formal Science.
Carlos Pedro dos Santos Gonçalves & Maria Odete Madeira, A Systems Theoretical Formal Logic for Category Theory.
Edward N. Zalta (1997). The Modal Object Calculus and its Interpretation. In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer. 249--279.
Ronald Laymon (1987). Using Scott Domains to Explicate the Notions of Approximate and Idealized Data. Philosophy of Science 54 (2):194-221.
Added to index2010-09-13
Total downloads5 ( #234,761 of 1,099,914 )
Recent downloads (6 months)1 ( #304,017 of 1,099,914 )
How can I increase my downloads?