*Workshop on Compositional Meaning in Logic [GeTFun
2.0]*<http://sqig.math.ist.utl.pt/GeTFun/2.0>
Affiliated with the Vienna Summer of Logic [VSL 2014] <http://vsl2014.at/>

Vienna, Austria
July 22-23, 2014
Submission deadline: April 5, 2014

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 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 the first edition<http://sqig.math.ist.utl.pt/GeTFun/1.0>,
the *Workshop on Compositional Meaning in Logic [GeTFun 2.0]* is again
dedicated to the study of various well-motivated ways in which such
attractive properties and metaproperties 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 raises 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 should consist of an abstract of up to 1,000 words, sent by
email before April 5, 2014 to <getf...@gmail.com>.

At least one author of each accepted contribution is expected to
participate in the workshop and present the work. The registration fee,
standard to the VSL event, is 200 euro per participant.
A post-workshop special issue of the journal Logica Universalis is being
planned, with fresh refereeing, in all cases.

Keynote speakers

Arnon Avron (Tel-Aviv University, IL)
Petr Cintula (Czech Academy of Sciences, CZ)
Nikolaos Galatos (University of Denver, USA)
João Marcos (UFRN, BR)

Organization

Agata Ciabattoni (TU Wien, AT)
Carlos Caleiro (SQIG-IT & U Lisboa, PT)

The workshop occurs within the scope of the FP7 Marie Curie IRSES project
GeTFun <http://sqig.math.ist.utl.pt/GeTFun>.


-- 
++++++++++++++++++++++++++++++++++++
Carlos Caleiro

SQIG - Instituto de Telecomunicações
Departamento de Matemática
Instituto Superior Técnico
Universidade de Lisboa

Av. Rovisco Pais, 1049-001 Lisboa
Portugal

tel: (+351) 218417138
fax: (+351) 218417048
email: carlos.cale...@tecnico.ulisboa.pt
www: sqig.math.ist.utl.pt/ccal
++++++++++++++++++++++++++++++++++++
_______________________________________________
Logica-l mailing list
Logica-l@dimap.ufrn.br
http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l

Responder a