PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
Tytuł artykułu

Explicit Constructive Logic ECL : a New Representation of Construction and Selection of Logical Information by an Epistemic Agent

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Konferencja
Italian Conference on Computational Logic, CILC 2013, (25-27.09.2013; Catania, Italy)
Języki publikacji
EN
Abstrakty
EN
One of the main goals of Explicit Constructive Logic (ECL) is to provide a constructive formulation of Full (Classical) Higher Order Logic LKω that can be seen as a foundation for knowledge representation. ECL is introduced as a subsystem Zω of LKω. The first order case Z1 and the propositional case Z0 of ECL are examined as well. A comparison of constructivism from the point of view of ECL and of the corresponding features of Intuitionistic Logic, and Constructive Paraconsistent Logic is proposed.
Wydawca
Rocznik
Strony
357--372
Opis fizyczny
Bibliogr. 10 poz.
Twórcy
autor
  • DIMA, University of Genoa, Via Dodecaneso 35, 16146 Genova, Italy
  • IMATI-CNR, via de Marini 6, 16149 Genova, Italy
autor
  • DIBRIS, University of Genoa, Via Dodecaneso 35, 16146 Genova, Italy
autor
  • DIMA, University of Genoa, Via Dodecaneso 35, 16146 Genova, Italy
Bibliografia
  • [1] Buss, S. R. (Ed.): Handbook of Proof Theory, Elsevier, 1998.
  • [2] Carnielli,W. A., Coniglio,M. E.,Marcos, J.: Logics of formal inconsistency, in: Handbook of Philosophical Logic, 2nd edition (D. Gabbay, F. Guenthner, Eds.), vol. 14, Kluwer-Springer, 2007, 15–107.
  • [3] Church, A.: A Formulation of the Simple Theory of Types, Journal of Symbolic Logic, 5, 1940, 56–68.
  • [4] De Marco, M., Lipton, J.: Completeness and Cut-elimination in the Intuitionistic Theory of Types, Journal of Logic and Computation, 15, 2005, 821–854.
  • [5] Forcheri, P., Gentilini, P., Molfino, M. T.: Informational Logic in knowledge representation and automated deduction, AI Communications, 12, 1999, 185–208.
  • [6] Gentilini, P.: Proof Theory and Mathematical Meaning of Paraconsistent C-Systems, Journal of Applied Logic, 9(3), 2011, 171–202.
  • [7] Gentilini, P., Martelli, M.: Abstract Deduction and Inferential Models for Type Theory, Information and Computation, 208(7), 2010, 737–777.
  • [8] Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform Proofs as a Foundation for Logic Programming, Annals of Pure and Applied Logic, 51, 1991, 125–157.
  • [9] Takeuti, G.: Proof Theory, North-Holland, 1987.
  • [10] Troelstra, A. S., van Dalen, D.: Constructivism in Mathematics, vol. 1, Elsevier, 1988
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-06a17b73-e17f-4aa7-8414-61706241740c
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.