Creating and sharing knowledge for telecommunications

Project: GeTFun - Generalizing Truth-Functionality

Acronym: GeTFun
Main Objective: The scientific guideline of the GeTFun project is to study and relate various well-motivated ways in which the attractive properties and meta-properties of truth-functionality may be generalized to cover more extensive logical grounds. Besides the abstract, model- and proof-theoretical aspects, the project will keep a strong focus in meaningful application areas where the complexity of the phenomena involved goes beyond the scope of standard approaches. The impact and relevance of the proposed line of work should accordingly be measured directly by its foundational character with respect to a better and deeper understanding of meaning in logics modeling complex phenomena and, of necessity, suitable general forms of compositional reasoning.
Reference: PIRSES-GA-2012-318986
Funding: EC/FP7
Start Date: 01-01-2013
End Date: 01-12-2016
Team: Carlos Manuel Costa Lourenço Caleiro
Groups: Security and Quantum Information - Lx
Partners: Academic College of Tel-Aviv-Yafo, Israel, Fundação Getúlio Vargas, Brazil, Institute of Computer Science of the Polish Academy of Sciences, Poland, Institute of Mathematics Simion Stoilov, Romania, King's College London, United Kingdom, Kryvyi Rih National University, Ukraine, Pontifícia Universidade Católica do Rio de Janeiro, Brazil, Technische Universitaet Wien, Austria, Tel-Aviv University, Israel, Universidade de Aveiro, Portugal, Universidade Estadual de Campinas, Brazil, Universidade Federal do Rio de Janeiro, Brazil, Universidade Federal do Rio Grande do Norte, Brazil
Local Coordinator: Carlos Manuel Costa Lourenço Caleiro
Links: http://sqig.math.ist.utl.pt/GeTFun
Associated Publications
  • 1Boock Chapters
  • C. Caleiro, S. Marcelino, P. Baltazar, Deciding theoremhood in fibred logics without shared connectives, Chapter in, JY Beziau's Festschrift, A. Buchsbaum, A. Koslow, Springer, 2014
  • 3Papers in Journals
  • C. Caleiro, J. Marcos, MV Volpe, Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics, Theoretical Computer Science, Vol. 608, No. 0, pp. 84 - 110, October, 2015 | BibTex
  • C. Caleiro, R. Gonçalves, Abstract valuation semantics, Studia Logica, Vol. 101, No. 4, pp. 677 - 712, July, 2013 | BibTex
  • C. Caleiro, L. Viganò, MV Volpe, On the mosaic method for many-dimensional modal logics: a case study combining tense and modal operators, Logica Universalis, Vol. 7, No. 1, pp. 33 - 69, January, 2013 | BibTex
  • 6Papers in Conferences
  • C. Caleiro, S. Marcelino, Conservativity of fibred logics via reflective translations, AiML.net Advances in Modal Logic - AiML, Groningen, Netherlands, Vol. 1, pp. 0 - 0, August, 2014 | BibTex
  • C. Caleiro, L. Viganò, MV Volpe, A labeled deduction system for the logic UB, Symp. on Temporal Representation and Reasoning, Pensacola, FL, United States, Vol. 978-1-4799-2240-6, pp. 45 - 53, September, 2013 | BibTex
  • C. Caleiro, J. Marcos, C. B. Blasio, On B-entailment, Logic Colloquium, Evora, Portugal, Vol. 0, pp. 0 - 0, July, 2013 | BibTex
  • C. Caleiro, S. Marcelino, P. Baltazar, Conservativeness and decidability of fibred logics, Logic Colloquium, Evora, Portugal, Vol. 0, pp. 0 - 0, July, 2013 | BibTex
  • J. Ramos, C. Caleiro, Classical and intuitionistic propositional logic, Logic Colloquium, Evora, Portugal, Vol. 0, pp. 0 - 0, July, 2013 | BibTex
  • C. Caleiro, S. Marcelino, Combining logics, cryptofibred semantics and completeness preservation, World Congress and School on Universal Logic - UNILOG, Rio de Janeiro, Brazil, Vol. 0, pp. 0 - 0, April, 2013 | BibTex