This is an excellent book for philosophers, and others concerned with natural language and cognition, who have not kept up with post-Aspects work in syntax, in particular with the Extended Standard Theory work on government and binding that relates to anaphora and quantification. It is a direct challenge to those who think that there must be a reasonably clearcut semantic level of description for sentences in natural language, one which is crucial for explaining how we learn, understand, and use (...) natural language. Hornstein argues that the properties of quantification such as relative quantifier scope and pronoun binding in natural language are best explained in purely syntactic terms. "Not only are the explanations best construed syntactically but, more important, the distinctions and concepts needed to articulate them cut against the semantic distinctions one would naturally make". This syntactic theory will, of course, be supplemented in a full theory of language use by pragmatic theories that will assign meaning, force, reference, etc., in particular contexts, given all sorts of real world knowledge. But what we won't have will be a compositional, context insensitive level of semantic description in which true, denotation, object, model, etc., loom large. Though Hornstein is a philosopher, his arguments derive from a linguist's familiarity with recent syntactical work; however, the general line is consonant with Stich's From Folk Psychology to Cognitive Science: The Case Against Belief, in which Stich argues beliefs are so context and intrepretive-stance relative that they cannot be grist for a scientific psychology, which must rather limit itself to syntactical characterizations of sentences in cognition. (shrink)

We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .

We review the properties of Global Index Grammars (GIGs), a grammar formalism that uses a stack of indices associated with productions and has restricted context-sensitive power. We show how the control of the derivation is performed and how this impacts in the descriptive power of this formalism both in the string languages and the structural descriptions that GIGs can generate.

This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if logic is (...) used as a metalanguage for English. In this case the declarative aspects of a rule are highlighted when we focus on the model theory of the description language while a procedural perspective is obtained when its proof theory is concentrated on. Themes of interest are Discourse Representation Theory, resolution of anaphora, resolution of presuppositions, and underspecification. (shrink)

An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of Marcus et al. 1983 has been integrated in Vijay-Shanker 1992 with a pure unification approach to Lexicalized Tree-Adjoining Grammars (Joshi et al. 1975, Schabes 1990). We generalize Description Theory by integrating semantic (...) information, that is, we propose to tackle both syntactic and semantic underspecification using descriptions. (shrink)

Could a computer be programmed to make moral judgments about cases of intentional harm and unreasonable risk that match those judgments people already make intuitively? If the human moral sense is an unconscious computational mechanism of some sort, as many cognitive scientists have suggested, then the answer should be yes. So too if the search for reflective equilibrium is a sound enterprise, since achieving this state of affairs requires demarcating a set of considered judgments, stating them as explanandum sentences, and (...) formulating a set of algorithms from which they can be derived. The same is true for theories that emphasize the role of emotions or heuristics in moral cognition, since they ultimately depend on intuitive appraisals of the stimulus that accomplish essentially the same tasks. Drawing on deontic logic, action theory, moral philosophy, and the common law of tort, particularly Terry's five-variable calculus of risk, I outline a formal model of moral grammar and intuitive jurisprudence along the foregoing lines, which defines the abstract properties of the relevant mapping and demonstrates their descriptive adequacy with respect to a range of common moral intuitions, which experimental studies have suggested may be universal or nearly so. Framing effects, protected values, and implications for the neuroscience of moral intuition are also discussed. (shrink)

Providing a compositional interpretation procedure for discourses in which descriptions of complex dependencies between interrelated objects are incrementally built is a key challenge for formal theories of natural language interpretation. This paper examines several quantificational phenomena and argues that to account for these phenomena, we need richly structured contexts of interpretation that are passed on between different parts of the same sentence and also across sentential boundaries. The main contribution of the paper is showing how we can add structure to (...) contexts in an incremental way, starting with the basic notion of context in classical first-order logic, i.e., interpretation contexts formalized as single total variable assignments. (shrink)

In Groenendijk & Stokhof [1989] a system of dynamic predicate logic (DPL) was developed, as a compositional alternative for classical discourse representation theory (DRT ). DPL shares with DRT the restriction of being a first-order system. In the present paper, we are mainly concerned with overcoming this limitation. We shall define a dynamic semantics for a typed language with λ-abstraction which is compatible with the semantics DPL specifies for the language of first-order predicate logic. We shall propose to use this (...) new logical system as the semantic component of a Montague-style grammar (referred to as dynamic Montague grammar, DMG), which will enable us to extend the compositionality of DPL to the subsentential level. Furthermore, we shall extend this analysis also in this sense that we shall add new, dynamic interpretations for logical constants which in DPL were treated in a static fashion. This will substantially increase the descriptive coverage of DMG. (shrink)

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus (...) truth-conditions as a model, it completely specifies thatgrammatical object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus (...) truth-conditions as a model, it completely specifies thatgrammatical object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

Lautemann et al. (1995) gave a descriptive characterisation of the class of context-free languages, showing that a language is context-free iff it is definable as the set of words satisfying some sentence of a particular logic (fragment) over words. The present notes discuss how to specialise this result to the class of linear languages. Somewhat surprisingly, what would seem the most straightforward specialisation actually fails, due to the fact that linear grammars fail to admit a Greibach normal form. We (...) identify an alternative specialisation, based on an alternative characterisation of context-free languages, also noted by Lautemann et al. (1995). (shrink)

Whatever one may think of Schmidt’s intuition, it is still nothing but intuition, and the variety of syntactic structures which εἶναι admits of is neither articulated nor unified. Kahn, on the other hand, by the use of Transformational Grammar, is able to a large extent to generate in a regular way from a posited notion of "kernel sentence" all the Greek sentences in which εἶναι occurs. Kahn’s original plan was "to correlate every intuitive difference of meaning in the use of (...) εἰμί with a formal description of the corresponding sentence-type", but he admits that he cannot always do so. Whether this is a failure inherent in Transformational Grammar itself, or in the version Kahn uses, can for the moment be left aside. First, an example of the success and another of the failure of the technique, as Kahn practices it, are in order. Kahn formulates the rule for the recognition of periphrasis somewhat as follows: εἶναι is used periphrastically with the participle if and only if it is impossible to obtain two kernel sentences, one of which has a finite form of εἶναι and the other a finite form of the participle, but if two kernel sentences can be so obtained, the usage is not periphrastic. This rule is both simple and elegant; it will no doubt become in time a standard part of Greek grammar. The enchantment, however, which mathematical clarity can cast is best illustrated in the case of another construction. ἔστιν ὅστις... is not uncommon. It looks like the existential operator of modern logic, and the fact that it occurs far more often with οὐκ than without seems to be, linguistically, irrelevant. Now, Kahn asserts that, though he looked hard for examples, he could only find one in which the second clause has the copula, and he offers a proof as to why this should be the case. He is mistaken. Euripides has οὐκ ἔστι θνητῶν ὅστις ἕστ’ ἐλεύθερος, and Sophocles καὶ οὐδὲν τούτων ὅ τι μὴ Ζεύς, and there are several examples in just one passage of Plato’s Charmides. The Sophoclean example is important since it illustrates a double "zeroing" of εἶναι, and whereas for traditional grammar such nominal sentences are treated as primary, with the insertion of ἐστί as a secondary development, in Kahn’s use of Transformational Grammar no distinction between the presence or the absence of the verb can be allowed. For deep structure, the verb is always present, and it might be no more than an apparent paradox that a verb, whose primitive meaning is said to designate presence, can in its absence make its presence equally felt. Can a verb which is almost always eliminable be the word for reality and truth? Or is it because "being" is the only word that cannot be just a word that it can so easily be suppressed in speech? (shrink)

The objectives of this paper are twofold. The first is to present a differentiation between two kinds of deferred uses of indexicals: those in which indexical utterances express singular propositions (I term them deferred reference proper) and those where they express general propositions (called descriptive uses of indexicals). The second objective is the analysis of the descriptive uses of indexicals. In contrast to Nunberg, who treats descriptive uses as a special case of deferred reference in which a property contributes to (...) the proposition expressed, I argue that examples in which a general proposition is indeed expressed by an indexical cannot be treated by assuming that the property is a deferred referent of the pronoun. I propose an analysis of descriptive uses of indexicals by means of a pragmatic mechanism of ‘descriptive anaphora’, which attempts to explain the special kind of contribution of the property retrieved from the context to the proposition that is characteristic of the descriptive interpretation. (shrink)

We investigate a new paradigm in the context of learning in the limit, namely, learning correction grammars for classes of computably enumerable (c.e.) languages. Knowing a language may feature a representation of it in terms of two grammars. The second grammar is used to make corrections to the first grammar. Such a pair of grammars can be seen as a single description of (or grammar for) the language. We call such grammars correction grammars. Correction (...) grammars capture the observable fact that people do correct their linguistic utterances during their usual linguistic activities. We show that learning correction grammars for classes of c.e. languages in the TxtEx-model (i.e., converging to a single correct correction grammar in the limit) is sometimes more powerful than learning ordinary grammars even in the TxtBe-model (where the learner is allowed to converge to infinitely many syntactically distinct but correct conjectures in the limit). For each n ≥ 0, there is a similar learning advantage, again in learning correction grammars for classes of c.e. languages, but where we compare learning correction grammars that make n + 1 corrections to those that make n corrections. The concept of a correction grammar can be extended into the constructive transfinite, using the idea of counting-down from notations for transfinite constructive ordinals. This transfinite extension can also be conceptualized as being about learning Ershov-descriptions for c.e. languages. For u a notation in Kleene's general system $(O,\, < _o )$ of ordinal notations for constructive ordinals, we introduce the concept of an u-correction grammar, where u is used to bound the number of corrections that the grammar is allowed to make. We prove a general hierarchy result: if u and v are notations for constructive ordinals such that $u\, < _o \,v$ , then there are classes of c.e. languages that can be TxtEx-learned by conjecturing v-correction grammars but not by conjecturing u-correction grammars. Surprisingly, we show that— above "ω-many" corrections—it is not possible to strengthen the hierarchy: TxtEx-learning u-correction grammars of classes of c.e. languages, where u is a notation in O for any ordinal, can be simulated by TxtBe-learning ω-correction grammars, where ω is any notation for the smallest infinite ordinal ω. (shrink)

Alex Oliver and Timothy Smiley provide a new account of plural logic. They argue that there is such a thing as genuinely plural denotation in logic, and expound a framework of ideas that includes the distinction between distributive and collective predicates, the theory of plural descriptions, multivalued functions, and lists.

Many of the formalisms used in Attribute Value grammar are notational variants of languages of propositional modal logic, and testing whether two Attribute Value Structures unify amounts to testing for modal satisfiability. In this paper we put this observation to work. We study the complexity of the satisfiability problem for nine modal languages which mirror different aspects of AVS description formalisms, including the ability to express re-entrancy, the ability to express generalisations, and the ability to express recursive constraints. Two (...) main techniques are used: either Kripke models with desirable properties are constructed, or modalities are used to simulate fragments of Propositional Dynamic Logic. Further possibilities for the application of modal logic in computational linguistics are noted. (shrink)

In 1929 Wittgenstein began to work on the first philosophical manuscripts he had kept since completing the Tractatus Logico-Philosophicus in 1918. The impetus for this was his conviction that the logic of the TLP was flawed: it was unable to account for the fact that a proposition that assigns a single value on a continuum to a simple object thereby excludes all assignments of different values to the object . Consequently Wittgenstein's "atomic propositions" could not be logically independent of one (...) another. ;Initially he thought he could replace the "logically perfect language" of the TLP with a "phenomenological language" in which experiential propositions about various "spaces" would form systems. The system described by a phenomenological language would be independent of the one described by ordinary "physicalistic" language; the physical "world" was known only by inference from the phenomenological. But he soon realized there was a fundamental error in this conception: phenomenology has to describe the same world as physics or it fails to provide a foundation for it. This suggests that there is only one world, and one language with two different modes of expression. Wittgenstein's now comes to his fundamental insight: ordinary language is biased towards the description of physical objects and their relations, but it is our only method of expressing phenomenological or abstract concepts. Failure to recognize this difficulty leads to the misapplication of physicalistic concepts, i.e., to grammatical errors. ;This insight had the following impact: the task of philosophy is not to invent logical or phenomenological languages, but to understand the grammar of ordinary language; the notion of a language of pure experience was itself connected with a false, physicalistic idea of the soul as an observer of a private world; the conception of analysis that had guided philosophy since Frege was based on a misused metaphor taken from the grammar of physics: the analysis of an object into its parts or chemical constituents. These ideas reach their ultimate expression in Wittgenstein's Philosophical Investigations. Thus his "later" work actually begins with these 1929--30 manuscripts. (shrink)

Recent developments in the semantics of natural language seem to lead to a genuine synthesis of ideas from linguistics and logic, producing novel concepts and questions of interest to both parent disciplines. This book is a collection of essays on such new topics, which have arisen over the past few years. Taking a broad view, developments in formal semantics over the past decade can be seen as follows. At the beginning stands Montague's pioneering work, showing how a rigorous semantics can (...) be given for complete fragments of natural language by creating a suitable fit between syntactic categories and semantic types. This very enterprise already dispelled entrenched prejudices concerning the separation of linguistics and logic. Having seen the light, however, there is no reason at all to stick to the letter of Montague's proposals, which are often debatable. Subsequently, then, many improvements have been made upon virtually every aspect of the enterprise. More sophisticated grammars have been inserted (lately, lexical-functional grammar and generalized phrase structure grammar), more sensitive model structures have been developed (lately, 'partial' rather than 'total' in their com position), and even the mechanism of interpretation itself may be fine-tuned more delicately, using various forms of 'representations' mediating between linguistic items and semantic reality. In addition to all these refinements of the semantic format, descriptive coverage has extended considerably. (shrink)

This paper investigates whether the fundamental linguistic insights and intuitions of Lexical Functional Grammar, which is usually presented as a constraint-based linguistic theory, can be reformulated in a resource sensitive framework using a substructural modal logic. In the approach investigated here, LFG's f-descriptions are replaced with expressions from a multi-modal propositional logic. In effect, the feature structure unification basis of LFG's f-structures is replaced with a very different resource based mechanism. It turns out that some linguistic analyses that required non-monotonic (...) devices in LFG analysis of Icelandic) can be straightforwardly expressed in the framework presented here. Moreover, a Curry– Howard correspondence between proofs in this logic and -terms provides a semantic interpretation as a by-product of the process of showing syntactic well-formedness. (shrink)

Dr Seuren's study deals with the problem of presenting an adequate model of grammatical description. The model he proposes conforms in its main outlines to the transformational generative grammar established by Chomsky, but differs in important respects. These mainly affect that part of Chomsky's syntactic component known as the 'base', which generates basic or 'deep' structures. In the model of the base proposed here two main constituents are distinguished for every deep structure representation of a sentence, vis-a-vis the operators (...) and the nucleus. The deep structure of a sentence is thus seen to be very similar to the logical structure of a proposition. The arguments given in support of this analysis are based on mainly on considerations of simplicity and semantic adequacy. (shrink)

Evidence is presented to show that the role of a generative grammar of a natural language is not merely to generate the grammatical sentences of that language, but also to relate them to their logical forms. The notion of logical form is to be made sense of in terms a natural logic, a logical for natural language, whose goals are to express all concepts capable of being expressed in natural language, to characterize all the valid inferences that (...) can be made in natural language, and to mesh with adequate linguistic descriptions of all natural languages. The latter requirement imposes empirical linguistic constraints on natural logic. A number of examples are discussed. (shrink)

Head-driven phrase structure grammar (HPSG) is one of the most prominent theories employed in deep parsing of natural language. Many linguistic theories are arguably best formalized in extensions of modal or dynamic logic (Keller, Feature logics, infinitary descriptions and grammar, 1993; Kracht, Linguistics Philos 18:401–458, 1995; Moss and Tiede, In: Blackburn, van Benthem, and Wolther (eds.) Handbook of modal logic, 2006), and HPSG seems to be no exception. Adequate extensions of dynamic logic have not been studied in detail, however; the (...) most important aspect is the reference to sets of substructures. In this paper, an adequate extension is identified, and some important results are established: Satisfiability is highly undecidable, and model checking is shown to be in EXPTIME and PSPACE-hard. A fragment with polynomial time model checking procedures is identified; it is shown to cover considerable fragments of HPSG. (shrink)

Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom.

Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering (...) syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems. (shrink)

This essay critically assesses Roman Ingarden’s 1915 review of the second edition of Edmund Husserl’s Logical Investigations. I elucidate and critique Ingarden’s analysis of the differences between the 1901 first edition and the 1913 second edition. I specifically examine three tenets of Ingarden’s interpretation. First, I demonstrate that Ingarden correctly denounces Husserl’s claim that he only engages in an eidetic study of consciousness in 1913, as Husserl was already performing eidetic analyses in 1901. Second, I show that Ingarden is (...) misguided, when he asserts that Husserl had fully transformed his philosophy into a transcendental idealism in the second edition. While Husserl does appear to adopt a transcendental phenomenology by asserting–in his programmatic claims–that the intentional content and object are now included in his domain of research, he does not alter his actual descriptions of the intentional relationship in any pertinent manner. Third, I show Ingarden correctly predicts many of the insights Husserl would arrive at about logic in his late philosophy. This analysis augments current readings of the evolution of Ingarden’s philosophy, by more closely examining the development of his largely neglected early thought. I execute this critical assessment by drawing both from Husserl’s later writings and from recent literature on the Investigations. By doing so, I hope to additionally demonstrate how research on the Investigations has matured in the one hundred years since the release of that text, while also presenting my own views concerning these difficult interpretative issues. (shrink)

The words ‘logic’ and ‘grammar’ are understood by all of us to refer to quite intricate doctrines, investigations, etc., which are presented in books which have been written in the past and which continue to be written in the present time.

Grammar can be formulated as a kind of substructural propositional logic. In support of this claim, we survey bare Gentzen style deductive systems and two kinds of non-commutative linear logic: intuitionistic and compact bilinear logic. We also glance at their categorical refinements.

This paper demonstrates that Edmund Husserl’s frequently overlooked 1890 manuscript, “On the Logic of Signs,” when closely investigated, reveals itself to be the hermeneutical touchstone for his seminal 1891 Philosophy of Arithmetic. As the former comprises Husserl’s earliest attempt to account for all of the different kinds of signitive experience, his conclusions there can be directly applied to the latter, which is focused on one particular type of sign; namely, number signs. Husserl’s 1890 descriptions of motivating and replacing signs will (...) be respectively employed to clarify his 1891 understanding of the authentic and inauthentic presentations of numbers via number signs. Moreover, his schematic classification of replacement-signs in Semiotic will illuminate the reasons why he believed the number system to be necessary for the operation of replacing number signs. (shrink)

Natural languages are riddled with context-sensitivity. One and the same string of words can express many different meanings on occasion of use, and yet we understand one another effortlessly, on the fly. How do we do so? What fixes the meaning of context-sensitive expressions, and how are we able to recover the meaning so effortlessly? -/- This book offers a novel response: we can do so because we draw on a broad array of subtle linguistic conventions that determine the interpretation (...) of context-sensitive items. Contrary to the dominant tradition, which maintains that the meaning of context-sensitive language is underspecified by grammar and that interpretation relies on non-linguistic cues and speakers' intentions, this book argues that meaning is determined entirely by discourse conventions, rules of language that have largely been missed and the effects of which have been mistaken for extra-linguistic effects of an utterance situation on meaning. The linguistic account of context developed here sheds new light on the nature of linguistic content and the interaction between content and context. At the same time, it provides a novel model of context that should constrain and help evaluate debates across many subfields of philosophy where appeal to context has been common, often leading to surprising conclusions such as epistemology, ethics, value theory, metaphysics, metaethics, and logic. (shrink)

I have written a number of articles recently that have a rather remarkable character. They all point out trivial grammatical facts that, at great cost, have not been respected in twentieth century Logic. A major continuous strand in my previous work, with this same character, I will first summarise, to locate the kind of fact that is involved. But then I shall present an overview of the more recent, and more varied points I have made, which demonstrate the far larger (...) extent of basic grammar that has been overlooked or suppressed. I end with some remarks about how this phenomenon can have arisen – principally through logicians not being attentive enough to their own language, and occupying themselves, instead, with often quite imaginary languages. (shrink)

I have written a number of articles recently that have a rather remarkable character. They all point out trivial grammatical facts that, at great cost, have not been respected in twentieth century Logic. A major continuous strand in my previous work, with this same character, I will first summarise, to locate the kind of fact that is involved. But then I shall present an overview of the more recent, and more varied points I have made, which demonstrate the far larger (...) extent of basic grammar that has been overlooked or suppressed. I end with some remarks about how this phenomenon can have arisen – principally through logicians not being attentive enough to their own language, and occupying themselves, instead, with often quite imaginary languages. (shrink)

In this volume, Bimal K. Matilal blends knowledge contained in original Sanskrit texts and modern philosophical terminology in interpreting and reconstructing early philosophical theories, highlighting the critical and analytical nature of the Indian philosophical tradition.

When we reason about strategic games, implicitly we need to reason about arbitrary strategy profiles and how players can improve from each profile. This structure is exponential in the number of players. Hence it is natural to look for subclasses of succinct games for which we can reason directly by interpreting formulas on the (succinct) game description rather than on the associated improvement structure. Priority separable games are one of such subclasses: payoffs are specified for pairwise interactions, and from (...) these, payoffs are computed for strategy profiles. We show that equilibria in such games can be described in Monadic Least Fixed Point Logic (MLFP). We then extend the description to games over arbitrarily many players, but using the monadic least fixed point extension of existential second order logic. (shrink)

In this paper we study automated reasoning in the modal logic CPDLreg which is a combination of CPDL (Propositional Dynamic Logic with Converse) and REGc (Regular Grammar Logic with Converse). The logic CPDL is widely used in many areas, including program verification, theory of action and change, and knowledge representation. On the other hand, the logic REGc is applicable in reasoning about epistemic states and ontologies (via Description Logics). The modal logic CPDLreg can serve as a technical foundation for (...) reasoning about agency. Even very rich multi-agent logics can be embedded into CPDLreg via a suitable translation. Therefore, CPDLreg can serve as a test bed to implement and possibly verify new ideas without providing specific automated reasoning techniques for the logic in question. This process can to a large extent be automated. The idea of embedding various logics into CPDLreg is illustrated on a rather advanced logic TEAMLOGK designed to specify teamwork in multi-agent systems. Apart from defining informational and motivational attitudes of groups of agents, TEAMLOGK allows for grading agents' beliefs, goals and intentions. The current paper is a companion to our paper (Dunin-Kęplicz et al., 2010a). The main contribution are proofs of soundness and completeness of the tableau calculus for CPDLreg provided in (Dunin-Kęplicz et al., 2010a). (shrink)