Arbitrary Institution Research Articles

Fraïssé–Hintikka theorem in institutions

Abstract We generalize the characterization of elementary equivalence by Ehrenfeucht–Fraïssé games to arbitrary institutions whose sentences are finitary. These include many-sorted first-order logic, higher-order logic with types, as well as a number of other logics arising in connection to specification languages. The gain for the classical case is that the characterization is proved directly for all signatures, including infinite ones.

European integration and the territorial‐administrative complex

Detractors of European integration and many of its protagonists invoke state territoriality where the social and the spatial come together in a “Territorial‐Administrative Complex”. Like the military‐industrial complex claiming once to procure security, protagonists claim to guarantee democratic legitimacy. At the same time, the interests of the territorial constituencies prevail over others. The underlying notion of space is absolute and of territory that of a container. Costs and benefits are calculated in terms pertaining to it. The underlying “meta‐geography” is one of boxes‐in‐boxes, but rather than viewing space as a container, based on academic literature in the matter, planners now pursue soft planning for soft spaces. In the face of the apparently incontestable claim of the Territorial‐Administrative Complex to a monopoly on the production of democratic legitimacy, the article points out, albeit rare examples of constitutional theorists challenge this monopoly. Voting in territorial constituencies, they claim, has never been properly argued for, making it an arbitrary institution.

Bilateral Investment Treaties dan Penyelesaian Arbritase Internasional (Studi Kasus Pencabutan Izin Kuasa Pertambangan Churchill Mining)

The aim of BITs is to protect the investment in foreign countries, enhance the market-oriented policy and create the practice of transparent and non-discriminant between state and investors. This research studied about some issues: first, how is the impact of Bilateral Investment Treaties (BITs) on the investment climate in the developing countries particularly in Indonesia? Second, how is the process of conflict solution if there is a conflict in Bilateral Investment Treaties? This is a normative research using the regulation approach. The research concluded that first; the implementation of the agreement of BITs conducted by Indonesia at the moment has led Indonesia as the host country to the loss and the contract is no longer relevant and needs to be revised. Second if there is a conflict, it can be solved through ICSID as an arbitrary institution towards the lawsuit of investment between states signing the contract of BITs.   Keywords: Lawsuit, investment, international arbitration

Downward Löwenheim–Skolem Theorem and interpolation in logics with constructors

The present paper describes a method for proving Downward Lowenheim-Skolem Theorem within an arbitrary institution satisfying certain logic properties. In order to demonstrate the applicability of the present approach, the abstract results are instantiated to many-sorted first-order logic and preorder algebra. In addition to the first technique for proving Downward Lowenheim-Skolem Theorem, another one is developed, in the spirit of institution-independent model theory, which consists of borrowing the result from a simpler institution across an institution comorphism. As a result the Downward LowenheimSkolem Property is exported from first-order logic to partial algebras, and from higher-order logic with intensional Henkin semantics to higher-order logic with extensional Henkin semantics. The second method successfully extends the domain of application of Downward Lowenheim-Skolem Theorem to other non-conventional logical systems for which the first technique may fail. One major application of Downward Lowenheim-Skolem Theorem is interpolation in constructor-based logics with universally quantified sentences. The interpolation property is established by borrowing it from a base institution for its constructor-based variant across an institution morphism. This result is important as interpolation for constructor-based first-order logics is still an open problem.

Property-oriented semantics of structured specifications

We consider structured specifications built from flat specifications using union, translation and hiding with their standard model-class semantics in the context of an arbitrary institution. We examine the alternative of sound property-oriented semantics for such specifications, and study their relationship to model-class semantics. An exact correspondence between the two (completeness) is not achievable in general. We show through general results on property-oriented semantics that the semantics arising from the standard proof system is the strongest sound and compositional property-oriented semantics in a wide class of such semantics. We also sharpen one of the conditions that does guarantee completeness and show that it is a necessary condition.

Herbrand theorems in arbitrary institutions

The basic logic programming semantic concepts, query, solutions, solution forms, and the fundamental results such as Herbrand theorems, are developed over any logical system, formalised as institution, by employing ‘institution-independent’ concepts of variable, substitution, quantifier, and atomic formulae. This sets semantical foundations for a uniform development of logic programming over a large variety of computing science logics, allowing for a clean combination of logic programming with other computing paradigms.

Denotational semantics of object specification

From an arbitrary temporal logic institution we show how to set up the corresponding institution of objects. The main properties of the resulting institution are studied and used in establishing a categorial, denotational semantics of several basic constructs of object specification, namely aggregation (parallel composition), interconnection, abstraction (interfacing) and monotonic specialization. A duality is established between the category of theories and the category of objects, as a corollary of the Galois correspondence between these concrete categories. The special case of linear temporal logic is analysed in detail in order to show that categorial products do reflect interleaving and reducts may lead to internal non-determinism.

Toward formal development of programs from algebraic specifications: Implementations revisited

The program development process is viewed as a sequence of implementation steps leading from a specification to a program. Based on an elementary notion of refinement, two notions of implementation are studied: constructor implementations which involve a construction “on top of” the implementing specification, and abstractor implementations which additionally provide for abstraction from some details of the implemented specification. These subsume most formal notions of implementation in the literature. Both kinds of implementations satisfy a vertical composition and a (modified) horizontal composition property. All the definitions and results are shown to generalise to the framework of an arbitrary institution, and a way of changing institutions during the implementation process is introduced. All this is illustrated by means of simple concrete examples.

Specifications in an arbitrary institution

A formalism for constructing and using axiomatic specifications in an arbitrary logical system is presented. This builds on the framework provided by Goguen and Burstall's work on the notion of an institution as a formalisation of the concept of a logical system for writing specifications. We show how to introduce free variables into the sentences of an arbitrary institution and how to add quantifiers which bind them. We use this foundation to define a set of primitive operations for building specifications in an arbitrary institution based loosely on those in the ASL kernel specification language. We examine the set of operations which results when the definitions are instantiated in institutions of total and partial first-order logic and compare these with the operations found in existing specification languages. We present proof rules which allow proofs to be conducted in specifications built using the operations we define. Finally, we introduce a simple mechanism for defining and applying parameterised specifications and briefly discuss the program development process.

On observational equivalence and algebraic specification

The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specification-building operation are studied. We begin with a definition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised to make sense under an arbitrary institution. Behavioural equivalence is treated as an important special case of observational equivalence, and its central role in program development is shown by means of an example.

Medieval Grammatical Theory and Chaucer's House of Fame

In the House of Fame, Chaucer takes up the problem of the nature of traditional texts and suggests, with humor and skepticism, that literary discourse is reducible to a form of speech, spoken sounds inscribed in texts as a form of written memory perpetuated by the arbitrary institution of tradition. Lady Fame personifies this institution. Although many critics have considered the House of Fame to be a poem about poetry and the burden of the past,' the key assumptions of medieval literary theory upon which the poem depends have not yet been discussed. Chaucer exploits some common topics of medieval ars grammatica, the discipline directly concerned with language, writing, and the texts of the auctores, and the literary problems developed throughout the poem are to be understood in the light of medieval grammatical theory. Chaucer interpreted Ovid's description of the Hall of Fama in Metamorphoses 12 with the conceptual framework of grammatical theory, giving Ovid's account of repeated spoken utterances (voces) a literary significance, and the Eagle's lecture on speech follows the topics of exposition found in the commentaries on Priscian's Institutiones grammaticae 1, De voce. Drawing from well-known treatises, commentaries, and encyclopedias of the medieval grammatical tradition, I will demonstrate that Chaucer relies upon, and assumes his reader's acquaintance with, some commonplaces of grammatica on the topics of speech, writing, texts, and history. The significance of grammatica for medieval literary theory and Chaucer studies has not yet been recognized. Throughout the Middle Ages grammatica was understood to have two related branches: the study and interpretation of traditional literary texts (ars interpretandi or enarratio), and the systematic account of literate discourse or linguistic theory and pedagogy (ratio recte loquendi et scribendi).2 The departments of grammatica were refor-