Team semantics

Vaughan Pratt pratt at cs.stanford.edu
Fri Apr 9 00:53:03 EDT 2021


Graham Leigh's advertisement for Jouko V:a:an:anen's upcoming April 26 Zoom
talk on team semantics reminded me of the paper

Plotkin, G.D. and Pratt, V.R,, ``Teams can see pomsets'', Workshop on
Partial Order Methods in Verification, Amer. Math. Soc., DIMACS series Vol.
29, 1997

a preliminary version of which can be downloaded from this site
<http://boole.stanford.edu/pub/teams.pdf>, namely

http://boole.stanford.edu/pub/teams.pdf

Although we wrote it in 1987 we didn't get around to doing anything with it
until a decade later.  It appeared to have sunk like a stone so we thought
nothing further of it.

The applicability of team semantics to Everett's Multiple World
Interpretation makes good sense.  But it occurs to me that it could be very
broadly applied to any situation calling for compromises, for example
between political parties with conflicting values.

In our case we applied it to situations where the relative order of events
was not necessarily well defined, for example as in relativity, which
nicely complements the application to quantum mechanics.

Vaughan Pratt

On Thu, Apr 8, 2021 at 8:31 PM <fom-request at cs.nyu.edu> wrote:

> Send FOM mailing list submissions to
>         fom at cs.nyu.edu
>
> To subscribe or unsubscribe via the World Wide Web, visit
>         https://cs.nyu.edu/mailman/listinfo/fom
> or, via email, send a message with subject or body 'help' to
>         fom-request at cs.nyu.edu
>
> You can reach the person managing the list at
>         fom-owner at cs.nyu.edu
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of FOM digest..."
>
>
> Today's Topics:
>
>    1. Nordic online logic seminar: Zoom talk by Jouko V??n?nen on
>       April 26 (Graham Leigh)
>    2. CfP: Computational Linguistics, Information, Reasoning, and
>       AI 2021 (CompLingInfoReasAI'21) (Roussanka Loukanova)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Thu, 8 Apr 2021 06:16:52 +0000
> From: Graham Leigh <graham.leigh at gu.se>
> To: FOM Mailing List <fom at cs.nyu.edu>
> Subject: Nordic online logic seminar: Zoom talk by Jouko V??n?nen on
>         April 26
> Message-ID: <AA378704-B712-47BC-8EA5-BF2F51F1D69A at gu.se>
> Content-Type: text/plain; charset="utf-8"
>
> The Nordic Online Logic Seminar (NOL Seminar) is organised monthly over
> Zoom, with expository talks on topics of interest for the broader logic
> community. The seminar is open for professional or aspiring logicians and
> logic aficionados worldwide.
>
> See the announcement below for the next talk. If you wish to receive the
> Zoom ID and password for it, as well as further announcements, please
> subscribe here: https://listserv.gu.se/sympa/subscribe/nordiclogic .
>
> Valentin Goranko and Graham Leigh
> NOL seminar organisers
>
> ------------------
> Nordic Online Logic Seminar
>
> Next talk: Monday, April 26, 16.00-17.30 CEST (UTC+2), on Zoom (details
> will be provided to subscribers)
>
> Title: Dependence logic: Some recent developments
>
>             Speaker: Jouko V??n?nen, University of Helsinki
>
> Abstract: In the traditional so-called Tarski?s Truth Definition the
> semantics of first order logic is defined with respect to an assignment of
> values to the free variables. A richer family of semantic concepts can be
> modelled if semantics is defined with respect to a set (a ?team?) of such
> assignments. This is called team semantics. Examples of semantic concepts
> available in team semantics but not in traditional Tarskian semantics are
> the concepts of dependence and independence. Dependence logic is an
> extension of first-order logic based on team semantics. It has emerged that
> teams appear naturally in several areas of sciences and humanities, which
> has made it possible to apply dependence logic and its variants to these
> areas. In my talk I will give a quick introduction to the basic ideas of
> team semantics and dependence logic as well as an overview of some new
> developments, such as quantitative analysis of team properties, a framework
> for a multiverse approach to set theor!
>  y, and pr
>  obabilistic independence logic inspired by the foundations of quantum
> mechanics.
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: </pipermail/fom/attachments/20210408/444a7977/attachment.html>
>
> ------------------------------
>
> Message: 2
> Date: Thu, 8 Apr 2021 20:59:47 +0200
> From: Roussanka Loukanova <rloukanova at gmail.com>
> To: fom at cs.nyu.edu
> Subject: CfP: Computational Linguistics, Information, Reasoning, and
>         AI 2021 (CompLingInfoReasAI'21)
> Message-ID:
>         <CALxfFF1=9HZ2qYW1a3qHx9uyBdPBQyo=KKR1X_mzogwK74=
> 02A at mail.gmail.com>
> Content-Type: text/plain; charset="utf-8"
>
> CALL FOR PAPERS
>
> Special Session:
> Computational Linguistics, Information, Reasoning, and AI 2021
> (CompLingInfoReasAI'21)
> Salamanca, Spain, 6th-8th October, 2021, HYBRID
>
> https://www.dcai-conference.net/special-sessions/clirai
>
> SCOPE:
> Computational and technological developments that incorporate natural
> language and reasoning methods are proliferating. Adequate coverage
> encounters difficult problems related to partiality, underspecification,
> agents, and context dependency, which are signature features of information
> in nature, natural languages, and reasoning.
>
> The session covers theoretical work, applications, approaches, and
> techniques for computational models of information, language (artificial,
> human, or natural in other ways), reasoning. The goal is to promote
> computational systems and related models of thought, mental states,
> reasoning, and other cognitive processes.
>
> TOPICS:
> We invite contributions relevant to the following topics, without being
> limited to them, across approaches, methods, theories, implementations, and
> applications:
>
> - Theorem provers and assistants
> - Model checkers
> - Theory of computation
> - Theory of information
> - Computational methods of inferences in natural language
> - Computational theories and systems of reasoning in natural language
> - Transfer of reasoning in natural language to theorem provers, or vice
> versa
> - Transfer of reasoning between natural language, theorem provers, model
> checkers, and various computational assistants
> - Computational approaches of computational linguistics for domain specific
> areas
> - Theories for applications to language, information processing, reasoning
> - Type theories for applications to language, information processing,
> reasoning
> - Computational grammar
> - Computational syntax
> - Computational semantics of natural languages
> - Computational syntax-semantics interface
> - Interfaces between morphology, lexicon, syntax, semantics, speech, text,
> pragmatics
> - Parsing
> - Multilingual processing
> - Large-scale grammars of natural languages
> - Models of computation and algorithms for linguistics, natural language
> processing, argumentation
> - Computational models of partiality, underspecification, and
> context-dependency
> - Models of situations, contexts, and agents, for applications to
> computational linguistics
> - Information about space and time in language models and processing
> ==
> - Data science in language processing
> - Machine learning of language and reasoning
> - Interdisciplinary methods
> - Integration of formal, computational, model theoretic, graphical,
> diagrammatic, statistical, and other related methods
> - Logic for information extraction or expression in written or spoken
> language
> - Logic for information integrations of diagrams, with written and / or
> spoken language
> ==
> - Formal models of argumentations
> - Interactive computation, reasoning, argumentation
> - Computation with heterogeneous information
> - Reasoning with heterogeneous and/or inconsistent information
> - Dialog, interactions
> - Interdisciplinary approaches to language, computation, reasoning, memory
> - Argumentation in AI applications, e.g., to business, economy, justice,
> health, medical sciences
>  ==
> - Language processing based on biological fundamentals of information and
> languages
> - Computational neuroscience of language
> - etc.
>
> IMPORTANT DATES
> Deadline: 30 April, 2021
> Notification of acceptance: 7 June, 2021
> Camera-Ready papers: 28 June, 2021
> Conference Celebration: 6-8 October, 2021
>
>
> PAPER SUBMISSION
> https://www.dcai-conference.net/special-sessions
> https://www.dcai-conference.net/submission
>
> The papers must consist of original, relevant and previously unpublished
> sound research results related to any of the topics of the Special Session
> CompLingInfoReasAI'21.
>
> Submitting papers
> DCAI Special Session papers must be formatted according to the Springer
> AISC Template, with a maximum length of 10 pages in length, including
> figures and references. All proposed papers must be submitted in electronic
> form (PDF format) using the Paper Submission Page.
>
> Publication
> Accepted papers will be included in DCAI Proceedings. At least one of the
> authors will be required to register and attend the symposium to present
> the paper in order to include the paper in the conference proceedings. All
> accepted papers will be published by Advances in Intelligent Systems and
> Computing series of Springer Verlag.
>
> Chair:
> Roussanka Loukanova,
> Institute of Mathematics and Informatics, Bulgarian Academy of Sciences,
> Bulgaria
> and Stockholm University, Sweden
> -------------- next part --------------
> An HTML attachment was scrubbed...
> URL: </pipermail/fom/attachments/20210408/49078ffa/attachment.html>
>
> ------------------------------
>
> Subject: Digest Footer
>
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> https://cs.nyu.edu/mailman/listinfo/fom
>
>
> ------------------------------
>
> End of FOM Digest, Vol 220, Issue 5
> ***********************************
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20210408/9617e5c8/attachment-0001.html>


More information about the FOM mailing list