scholarly journals Slanted Canonicity of Analytic Inductive Inequalities

2021 ◽  
Vol 22 (3) ◽  
pp. 1-41
Author(s):  
Laurent De Rudder ◽  
Alessandra Palmigiano
Keyword(s):  
Canonical Extension ◽  
Structural Rules ◽  
Arbitrary Signature ◽  
The Given ◽  
Display Calculus

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or open elements of its canonical extension. Interestingly, the syntactic shape of LE-inequalities which guarantees their canonicity in this generalized setting turns out to coincide with the syntactic shape of analytic inductive inequalities , which guarantees LE-inequalities to be equivalently captured by analytic structural rules of a proper display calculus. We show that this canonicity result connects and strengthens a number of recent canonicity results in two different areas: subordination algebras, and transfer results via Gödel-McKinsey-Tarski translations.

Quantifying Commitment in Nash Equilibria

2019 ◽  
Vol 21 (02) ◽  
pp. 1940011
Author(s):  
Thomas A. Weber
Keyword(s):  
Nash Equilibrium ◽  
Normal Form ◽  
Nash Equilibria ◽  
Dynamic Game ◽  
Subgame Perfect Equilibrium ◽  
Canonical Extension ◽  
Perfect Equilibrium ◽  
Form Game ◽  
Normal Form Game ◽  
The Given

To quantify a player’s commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a “canonical extension,” which allows each player to adjust his or her move with a certain probability. The commitment measure relates to the average overall adjustment probabilities for which the given Nash equilibrium can be implemented as a subgame-perfect equilibrium in the canonical extension.

scholarly journals Substructural Negations

2015 ◽  
Vol 12 (4) ◽  
Author(s):  
Takuro Onishi
Keyword(s):  
Sequent Calculus ◽  
Structural Rules ◽  
Display Calculus

We present substructural negations, a family of negations (or negative modalities) classified in terms of structural rules of an extended kind of sequent calculus, display calculus. In considering the whole picture, we emphasize the duality of negation. Two types of negative modality, impossibility and unnecessity, are discussed and "self-dual" negations like Classical, De Morgan, or Ockham negation are redefined as the fusions of two negative modalities. We also consider how to identify, using intuitionistic and dual intuitionistic negations, two accessibility relations associated with impossibility and unnecessity.

A Non-Interleaving Semantics for CCS Based on Proved Transitions

1988 ◽  
Vol 11 (4) ◽  
pp. 433-452 ◽  
Author(s):  
Gérard Boudol ◽  
Ilaria Castellani
Keyword(s):  
Partial Order ◽  
Transition Systems ◽  
Structural Rules ◽  
Labelled Transition Systems ◽  
Interleaving Semantics ◽  
Partial Order Semantics ◽  
The Given

When using labelled transition systems to model languages like CCS or TCSP, one specifies transitions by a set of structural rules. We consider labelling transitions with their proofs – in the given system of rules – instead of simple actions. Then the label of a transition identifies uniquely that transition, and one may use this information to define a concurrency relation on (proved) transitions, and a notion of residual of a (proved) transition by a concurrent one. We apply Berry and Lévy’s notion of equivalence by permutations to sequences of proved transitions for CCS to obtain a partial order semantics for this language.

PRESERVATION OF STRUCTURAL PROPERTIES IN INTUITIONISTIC EXTENSIONS OF AN INFERENCE RELATION

2018 ◽  
Vol 24 (3) ◽  
pp. 291-305 ◽  
Author(s):  
TOR SANDQVIST
Keyword(s):  
Structural Properties ◽  
Sequent Calculus ◽  
General Nature ◽  
Cut Elimination ◽  
Formal Proofs ◽  
Structural Rules ◽  
Logical Operators ◽  
First Order ◽  
Order Language ◽  
The Given

AbstractThe article approaches cut elimination from a new angle. On the basis of an arbitrary inference relation among logically atomic formulae, an inference relation on a language possessing logical operators is defined by means of inductive clauses similar to the operator-introducing rules of a cut-free intuitionistic sequent calculus. The logical terminology of the richer language is not uniquely specified, but assumed to satisfy certain conditions of a general nature, allowing for, but not requiring, the existence of infinite conjunctions and disjunctions. We investigate to what extent structural properties of the given atomic relation are preserved through the extension to the full language. While closure under the Cut rule narrowly construed is not in general thus preserved, two properties jointly amounting to closure under the ordinary structural rules, including Cut, are.Attention is then narrowed down to the special case of a standard first-order language, where a similar result is obtained also for closure under substitution of terms for individual parameters. Taken together, the three preservation results imply the familiar cut-elimination theorem for pure first-order intuitionistic sequent calculus.In the interest of conceptual economy, all deducibility relations are specified purely inductively, rather than in terms of the existence of formal proofs of any kind.

Personal Problem Solving of Partners in Divorce Proceedings

2015 ◽  
Vol 36 (1) ◽  
pp. 82-103 ◽  
Author(s):  
Tereza Soukupova ◽  
Petr Goldmann
Keyword(s):  
Gender Differences ◽  
Problem Solving ◽  
Thematic Apperception Test ◽  
Scoring Systems ◽  
Personal Control ◽  
Personality Characteristics ◽  
Personal Problem ◽  
Thematic Apperception ◽  
And Gender ◽  
The Given

Abstract. The Thematic Apperception Test is one of the most frequently administered apperceptive techniques. Formal scoring systems are helpful in evaluating story responses. TAT stories, made by 20 males and 20 females in the situation of legal divorce proceedings, were coded for detection and comparison of their personal problem solving ability. The evaluating instrument utilized was the Personal Problem Solving System-Revised (PPSS-R) as developed by G. F. Ronan. The results indicate that in relation to card 1, men more often than women saw the cause of the problem as removable. With card 6GF, women were more motivated to resolve the given problem than were men, women had a higher personal control and their stories contained more optimism compared to men’s stories. In relation to card 6BM women, more often than men, used emotions generated from the problem to orient themselves within the problem. With card 13MF, the men’s level of stress was less compared to that of the women, and men were more able to plan within the context of problem-solving. Significant differences in the examined groups were found in those cards which depicted significant gender and parental potentials. The TAT can be used to help identify personality characteristics and gender differences.

Pattern Recognition in Histo-Pathology: Basic Considerations

1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser
Keyword(s):  
Pattern Recognition ◽  
Graph Theory ◽  
Normal Tissue ◽  
Diagnostic Procedures ◽  
Minimal Distance ◽  
Malignant Growth ◽  
Colon Tissue ◽  
First Results ◽  
Tissue Structures ◽  
The Given

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.

Coordinating Medical Literature with Patient Care

1977 ◽  
Vol 16 (04) ◽  
pp. 234-240 ◽  
Author(s):  
Joann Gustafson ◽  
J. Nelson ◽  
Ann Buller
Keyword(s):  
Health Care ◽  
Medical Staff ◽  
Medical Information ◽  
Medical Literature ◽  
Medical Information System ◽  
Staff Members ◽  
Information Displays ◽  
Medical Displays ◽  
Computerized Medical Information ◽  
The Given

The contribution of a special library project to a computerized problem-oriented medical information system (PROMIS) is discussed. Medical information displays developed by the PROMIS medical staff are accessible to the health care provider via touch screen cathode terminals. Under PROMIS, members of the library project developed two information services, one concerned with the initial building of the medical displays and the other with the updating of this information. Information from 88 medical journals is disseminated to physicians involved in the building of the medical displays. Articles meeting predetermined selection criteria are abstracted and the abstracts are made available by direct selective dissemination or via a problem-oriented abstract file. The updating service involves comparing the information contained in the selected articles with the computerized medical displays on the given topic. Discrepancies are brought to the attention of PROMIS medical staff members who evaluate the information and make appropriate changes in the displays. Thus a feedback loop is maintained which assures the completeness, accuracy, and currency of the computerized medical information. The development of this library project and its interface with the computerized health care system thus attempts to deal with the problems in the generation, validation, dissemination, and application of medical literature.

Identification and Transformation of Terminal Morphemes in Medical English

1969 ◽  
Vol 8 (02) ◽  
pp. 84-90 ◽  
Author(s):  
A. W. Pratt ◽  
M. Pacak
Keyword(s):  
Word Form ◽  
Subsequent Transformation ◽  
Part Of Speech ◽  
Morphological Segmentation ◽  
Medical English ◽  
Nominal Form ◽  
Admissible Path ◽  
Near Future ◽  
The Given ◽  
Admissible Sequences

The system for the identification and subsequent transformation of terminal morphemes in medical English is a part of the information system for processing pathology data which was developed at the National Institutes of Health.The recognition and transformation of terminal morphemes is restricted to classes of adjectivals including the -ING and -ED forms, nominals and homographic adjective/noun forms.The adjective-to-noun and noun-to-noun transforms consist basically of a set of substitutions of adjectival and certain nominal suffixes by a set of suffixes which indicate the corresponding nominal form(s).The adjectival/nominal suffix has a polymorphosyntactic transformational function if it has the property of being transformed into more than one nominalizing suffix (e.g., the adjectival suffix -IC can be substituted by a set of nominalizing suffixes -Ø, -A, -E, -Y, -IS, -IA, -ICS): the adjectival suffix has a monomorphosyntactic transformational property if there is only one admissible transform (e.g., -CIC → -X).The morphological segmentation and the subsequent transformations are based on the following principles:a. The word form is segmented according to the principle of »double consonant cut,« i.e., terminal characters following the last set of double consonants are analyzed and treated as a potential suffix. For practical purposes only such terminal suffixes of a maximum length of four have been analyzed.b. The principle that the largest segment of a word form common to both adjective and noun or to both noun stems is retained as a word base for transformational operations, and the non-identical segment is considered to be a »suffix.«The backward right-to-left character search is initiated by the identification of the terminal grapheme of the given word form and is extended to certain admissible sequences of immediately preceding graphemes.The nodes which represent fixed sequences of graphemes are labeled according to their recognition and/or transformation properties.The tree nodes are divided into two groups:a. productive or activatedb. non-productive or non-activatedThe productive (activated) nodes are sequences of sets of graphemes which possess certain properties, such as the indication about part-of-speech class membership, the transformation properties, or both. The non-productive (non-activated) nodes have the function of connectors, i.e., they specify the admissible path to the productive nodes.The computer program for the identification and transformation of the terminal morphemes is open-ended and is already operational. It will be extended to other sub-fields of medicine in the near future.

The Role and Place of Budget Procedure in the System

2003 ◽  
pp. 42-49 ◽  
Author(s):  
E. Bushmin
Keyword(s):  
Budget Process ◽  
Public Expenditures ◽  
Principal Role ◽  
Process Trends ◽  
The Given ◽  
Rules Of The Game

The article is devoted to the analysis of improving budget process trends. The author offers the concept of "financial technologism". Its usage should promote an essential improvement of the budget process. The given concept is based on the fact that the regulation of budget procedure is the process of determination of "rules of the game", and the order of interaction of different institutions within the framework of the budget process, and the trends and volumes of expenses are the strategy of institutions. The procedure within the budget process plays a principal role as compared with the trends and volumes of public expenditures.

Sign in / Sign up

Export Citation Format

Share Document