1 resultado para Logic of the kinship
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biodiversity Heritage Library, United States (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (11)
- Brock University, Canada (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (1)
- CentAUR: Central Archive University of Reading - UK (12)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (3)
- CUNY Academic Works (9)
- Deakin Research Online - Australia (34)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (2)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (8)
- Indian Institute of Science - Bangalore - Índia (3)
- Instituto Politécnico do Porto, Portugal (1)
- Memoria Académica - FaHCE, UNLP - Argentina (9)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (1)
- Nottingham eTheses (2)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (16)
- Queensland University of Technology - ePrints Archive (689)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (6)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- School of Medicine, Washington University, United States (1)
- Universidad de Alicante (5)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (12)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (1)
- Universitat de Girona, Spain (2)
- Université de Montréal, Canada (3)
- University of Michigan (61)
- University of Queensland eSpace - Australia (11)
- University of Washington (1)
- WestminsterResearch - UK (2)
Resumo:
The logic of proofs (lp) was proposed as Gdels missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for lp have not explored this closeness with S4 and contain rules whose analycity is not immediately evident. We study possible formulations of analytic tableau proof methods for lp that preserve the subformula property. Two sound and complete tableau decision methods of increasing degree of analycity are proposed, KELP and preKELP. The latter is particularly inspired on S4-proofs. The crucial role of proof constants in the structure of lp-proofs methods is analysed. In particular, a method for the abduction of proof constant specifications in strongly analytic preKELP proofs is presented; abduction heuristics and the complexity of the method are discussed.