Compositional Meaning in Logic [GeTFun 4.0]

8th International Joint Conference on Automated Reasoning, Coimbra, Portugal

July 1-2, 2016


Organized by


  • Manuel A. Martins (CIDMA & UA, PT)
  • João Marcos (DIMAp-UFRN, BR)
  • Carlos Caleiro (SQIG-IT & U Lisboa, PT)


The Fregean-inspired Principle of Compositionality of Meaning (PoC), for formal languages, may be construed as asserting that the meaning of a compound expression is deterministically (and often recursively) analysable in terms of the meaning of its constituents, taking into account the mode in which these constituents are combined so as to form the compound expression. From a logical point of view, this amounts to prescribing a constraint - that may or may not be respected - on the internal mechanisms that build and give meaning to a given formal system. Within the domain of formal semantics and of the structure of logical derivations, PoC is often directly reflected by metaproperties such as truth-functionality and analyticity, characteristic of computationally well-behaved logical systems.


After the success of its firstsecond and third editions, the workshop GeTFun 4.0 is dedicated to the study of various well-motivated ways in which the attractive properties and metaproperties of truth-functional logics may be stretched so as to cover more extensive logical grounds. The ubiquity of non-classical logics in the formalization of practical reasoning demands the formulation of more flexible theories of meaning and compositionality that allow for the establishment of coherent and inclusive bases for their understanding. Such investigations presuppose not only the development of adequate frameworks from the perspectives of Model Theory, Proof Theory and Universal Logic, but also the construction of solid bridges between the related approaches based on various generalizations of truth-functionality. Applications of broadly truth-functional logics, in their various guises, are envisaged in several areas of computer science, mathematics, philosophy and linguistics, where the ever increasing complexity of systems continuously raise new and difficult challenges to compositionality.


We welcome submissions on all topics related to compositionality of meaning in logic, and in particular to issues connected to generalizations of metalogical notions such as:

  • truth-functionality
  • nondeterminism in semantics
  • logical bivalence vs algebraic many-valuedness
  • analyticity
  • subformula principle and complexity measures
  • semantic effectiveness and decision procedures for non-classical logics
  • cut-free vs cut-based proof formalisms
  • proof strategies and proof-search
  • modular logical specification formalisms
  • rule invertibility, structurality and logical harmony

Submissions, consisting of an abstract of up to 1,000 words, should be sent by email before April 15, 2016 to the Gmail account: getfunw.


Each contributed talk is planned to have the duration of 25 minutes, divided into 20 minutes of presentation and 5 minutes of discussion.


Keynote Speakers


  • Umberto Rivieccio (UFRN, BR and TU Delft, NL)
Twist-structure semantics
  • Amílcar Sernadas (U Lisboa, PT)
 Reasoning about quantum observations
  • Yaroslav Shramko (Kryvyi Rih NU, UA)
The logics for generalized truth-value multilattices 
  • Luca Viganò (King's College, UK)
Alpha-Beta privacy

Accepted Contributions and Schedule

The GeTFun 4.0 workshop occurs within the scope of the Marie Curie EU FP7 IRSES project GeTFun.