posted by user: sological || 1272 views || tracked by 2 users: [display]

GeTFun 2.0 2014 : Compositional Meaning in Logic


When Jul 22, 2014 - Jul 23, 2014
Where Vienna
Submission Deadline Apr 5, 2014
Notification Due Apr 19, 2014
Final Version Due May 5, 2014
Categories    logic

Call For Papers

Compositional Meaning in Logic [GeTFun 2.0]
Vienna Summer of Logic, Vienna, Austria
July 22-23, 2014

Organized by

Agata Ciabattoni (TU Wien, AT)
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 first edition, the workshop GeTFun 2.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:
nondeterminism in semantics
logical bivalence vs algebraic many-valuedness
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 the Gmail account: getfunw.

A post-workshop special issue of a journal is being planned, with fresh refereeing, in all cases.

Keynote Speakers

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

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

Related Resources

LICS 2018   Logic in Computer Science
IJCAR 2018   9th International Joint Conference on Automated Reasoning
INISTA 2018   IEEE International Conference on Innovations in Intelligent SysTems and Applications
LOGLEG 2018   Logic, Law and Legal Reasoning
Logica 2018   Logica 2018
FoIKS 2018   10th International Symposium on Foundations of Information and Knowledge Systems
FLOPS 2018   International Symposium on Functional and Logic Programming
SetVR 2018   International Workshop on Set Visualization and Reasoning
LearnAut 2018   Learning and Automata (LearnAut) -- FLoC 2018 Workshop
KRR@SAC 2018   KRR@SAC 2018 : Knowledge Representation and Reasoning (track of the 33rd ACM/SIGAPP Symposium On Applied Computing)