Fwd: GeTFun special issue of Logica Universalis - second call

[Joao Marcos]

---------- Forwarded message ----------

Special Issue of Springer’s Journal Logica Universalis
on Generalizations of Truth-Functionality and Compositional Meaning in Logic


********************

​********​

***
*** CALL FOR PAPERS ***
**********************

​********​

*


BACKGROUND AND SCOPE
==================

​===​

==

We are guest-editing a Special Issue of Springer’s journal Logica Universalis devoted to generalizations of truth-functionality and compositional meaning in logic, in general. This initiative was prompted by the success of the series of GeTFun Workshops (sqig.math.ist.utl.pt/GeTFun), devoted to these topics, but submission to this special issue will be open to anyone interested.

Contributions are welcomed on the following topics and related ones:

Truth-functionality
Non-determinism in semantics
Logical bivalence vs algebraic many-valuedness
Analyticity
Subformula principles 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

SUBMISSION
=======

​=​

===

Submitted papers must be original and not submitted for journal publication elsewhere, and will be subject to standard journal refereeing process.

Authors should submit their papers electronically, only in portable document format (pdf), by  November 1, 2016 December 1, 2016, via the electronic submission web-site powered by easy chair:
http://www.easychair.org/conferences/?conf=getfun123

The cover page of the submission should include the following information:
- paper title
- author names
- coordinates of the corresponding author
- abstract of the paper

Authors are strongly encouraged to use the journal's LaTeX macro package available at the website of Logica Universalis (http://www.springer.com/birkhauser/mathematics/journal/11787).

EDITORS
====

​=​

===

Carlos Caleiro (IT & IST, Univ. Lisboa, Portugal)
Luca Viganò (King's College London, United Kingdom)