Logical consequence and combinations of logics: fundaments and efficient applications

• Grant number: 04/14107-2
• Support Opportunities: Research Projects - Thematic Grants
• Start date: April 01, 2005
• End date: March 31, 2010
• Field of knowledge: Humanities - Philosophy - Logic
• Principal Investigator: Walter Alexandre Carnielli
• Grantee: Walter Alexandre Carnielli
• Host Institution: Centro de Lógica, Epistemologia e História da Ciência (CLE). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Pesquisadores principais: Itala Maria Loffredo D'Ottaviano ; Marcelo Esteban Coniglio
• Associated research grant(s): 06/52641-6 - Peircean pragmatic truth and da Costa's quasi-truth, AR.EXT
• Associated scholarship(s): 08/07760-2 - Paraconsistent logic programming based on Logics of Formal Inconsistency, BP.MS; 07/08722-4 - Computability and undecidability, BP.IC; 05/60568-4 - Research proposal logical consequence and combinations of logics: fundaments and efficient applications, BP.PD

Abstract

The notion of logical inference is of fundamental importance not only in all forms of argumentation (be it formal or informal) but also ins several aspects of computing. Study of logical inference for applications requires understanding combinations of logical mechanisms in several guises. This project is focused on specific methods for combining logics and their semantical, algebraic and computational aspects. Approximating propositional and quantified inferences is a promising approach in taming of the intrinsic complexities of this task. Intimately related to the quest for efficiency and with the research effort of understanding combinations of logics, quantum logics and quantum computation arise as a11 important research area. This requires multidisciplinary researches involved in the hard task of providing efficient alternatives traditional methods of inference. This project involves 22 researchers with different backgrounds from USP and Unicamp with the support of 8 researchers from three international institutions. (AU)

Scientific publications

(22)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

VELOSO, PAULO A. S.; VELOSO, SHEILA R. M.; VIANA, PETRUCIO; DE FREITAS, RENATA; BENEVIDES, MARIO; DELGADO, CARLA. On vague notions and modalities: a modular approach. LOGIC JOURNAL OF THE IGPL, v. 18, n. 3, p. 381-402, JUN 2010. (04/14107-2)

CARNIELLI, WALTER; CAROLINO, PIETRO K.. ADJUSTING A CONJECTURE OF ERDOS. CONTRIBUTIONS TO DISCRETE MATHEMATICS, v. 6, n. 1, p. 154-159, 2011. (04/14107-2)

SERNADAS, AMILCAR; SERNADAS, CRISTINA; RASGA, JOAO; CONIGLIO, MARCELO. A Graph-theoretic Account of Logics. JOURNAL OF LOGIC AND COMPUTATION, v. 19, n. 6, p. 1281-1320, DEC 2009. (04/14107-2)

CARNIELLI, WALTER. The Single-minded Pursuit of Consistency and its Weakness. STUDIA LOGICA, v. 97, n. 1, p. 81-100, FEB 2011. (04/14107-2)

AGUDELO, JUAN C.; CARNIELLI, WALTER. POLYNOMIAL RING CALCULUS FOR MODAL LOGICS: A NEW SEMANTICS AND PROOF METHOD FOR MODALITIES. Review of Symbolic Logic, v. 4, n. 1, p. 150-170, MAR 2011. (04/14107-2)

OLIVEIRA, IGOR CARBONI; CARNIELLI, WALTER. The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories. LOGIC JOURNAL OF THE IGPL, v. 16, n. 6, p. 585-590, DEC 2008. (04/14107-2)

RABELLO, GUILHERME DE SOUZA; FINGER, MARCELO. Approximations of Modal Logic K. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 143, p. 14-pg., 2006-01-06. (04/14107-2)

AGUDELO, JUAN C.; CARNIELLI, WALTER; AKL, SG; CALUDE, CS; DINNEEN, MJ; ROZENBERG, G; WAREHAM, HT. Unconventional models of computation through non-standard logic circuits. Lecture Notes in Computer Science, v. 4618, p. 3-pg., 2007-01-01. (04/14107-2)

CONIGLIO, MARCELO ESTEBAN. Recovering a Logic from Its Fragments by Meta-Fibring. LOGICA UNIVERSALIS, v. 1, n. 2, p. 40-pg., 2007-10-01. (04/14107-2)

CARNIELLI, WALTER; GRACIO, MARIA CLAUDIA C.. MODULATED LOGICS AND FLEXIBLE REASONING. LOGIC AND LOGICAL PHILOSOPHY, v. 17, n. 3, p. 39-pg., 2008-01-01. (04/14107-2)

DE FREITAS, RENATA; VELOSO, SHEILA R. M.; VELOSO, PAULO A. S.; VIANA, PETRUCIO; ARTEMOV, S; NERODE, A. Positive Fork Graph Calculus. Lecture Notes in Computer Science, v. 5407, p. 2-pg., 2009-01-01. (04/14107-2)

FINGER, MARCELO. Using Abduction to Compute Efficient Proofs. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 247, p. 11-pg., 2009-08-04. (04/14107-2)

BUENO-SOLER, JULIANA. Models for anodic and cathodic multimodalities. LOGIC JOURNAL OF THE IGPL, v. 20, n. 2, p. 19-pg., 2012-04-01. (08/03995-5, 04/14107-2)

BUENO-SOLER, JULIANA. Models for anodic and cathodic multimodalities. LOGIC JOURNAL OF THE IGPL, v. 20, n. 2, SI, p. 458-476, APR 2012. (04/14107-2, 08/03995-5)

BEZIAU, JEAN-YVES; CONIGLIO, MARCELO E.. To distribute or not to distribute?. LOGIC JOURNAL OF THE IGPL, v. 19, n. 4, SI, p. 566-583, AUG 2011. (04/14107-2)

AGUDELO, JUAN C.; CARNIELLI, WALTER. Paraconsistent Machines and their Relation to Quantum Computing. JOURNAL OF LOGIC AND COMPUTATION, v. 20, n. 2, p. 573-595, APR 2010. (04/14107-2)

RASGA, JOAO; CARNIELLI, WALTER; SERNADAS, CRISTINA. Interpolation via translations. MATHEMATICAL LOGIC QUARTERLY, v. 55, n. 5, p. 515-534, OCT 2009. (04/14107-2)

CONIGLIO, M. E.; SERNADAS, A.; SERNADAS, C.. Preservation by fibring of the finite model property. JOURNAL OF LOGIC AND COMPUTATION, v. 21, n. 2, p. 375-402, APR 2011. (04/14107-2)

D'AGOSTINO, MARCELLO; FINGER, MARCELO; GABBAY, DOV. Cut-Based Abduction. LOGIC JOURNAL OF THE IGPL, v. 16, n. 6, p. 537-560, DEC 2008. (04/14107-2)

BEZIAU, JEAN-YVES; CONIGLIO, MARCELO E.. To distribute or not to distribute?. LOGIC JOURNAL OF THE IGPL, v. 19, n. 4, p. 18-pg., 2011-08-01. (04/14107-2)

BUENO-SOLER, JULIANA. Two Semantical Approaches to Paraconsistent Modalities. LOGICA UNIVERSALIS, v. 4, n. 1, p. 24-pg., 2010-03-01. (08/03995-5, 04/14107-2)

NETO, ADOLFO; KAESTNER, CELSO A. A.; FINGER, MARCELO. Towards an Efficient Prover for the C-1 Paraconsistent Logic. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 256, p. 16-pg., 2009-12-02. (04/14107-2)