Modulated fibring and the collapsing problem

2002 ◽  
Vol 67 (4) ◽  
pp. 1541-1569 ◽  
Author(s):  
Cristina Sernadas ◽  
João Rasga ◽  
Walter A. Carnielli
Keyword(s):  
Mathematical Logic ◽  
Soundness And Completeness ◽  
The Given ◽  
Combining Logics

AbstractFibring is recognized as one of the main mechanisms in combining logics, with great significance in the theory and applications of mathematical logic. However, an open challenge to fibring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that fibring imposes unwanted interconnections between the given logics. Modulated fibring allows a finer control of the combination, solving the collapsing problem both at the semantic and deductive levels. Main properties like soundness and completeness are shown to be preserved, comparison with fibring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem.

scholarly journals Outline of an Introduction to Mathematical Logic II

1958 ◽  
Vol 1 (2) ◽  
pp. 113-127
Author(s):  
Abraham Robinson
Keyword(s):  
Mathematical Logic ◽  
General Character ◽  
Preceding Section ◽  
The Given

It is the purpose of the calculus described in the preceding section (i) to yield as theorems all tautologies which can be formulated in terms of the given variables, and (ii) to yield no other formulae as theorems. We shall establish presently that these two conditions are indeed satisfied. However, there are questions of a more general character which can be solved both with regard to the present calculus and with regard to many other calculi, including some with a more comprehensive vocabulary.

scholarly journals Local Model Checking and Traces

1994 ◽  
Vol 1 (17) ◽  
Author(s):  
Allan Cheng
Keyword(s):  
Model Checking ◽  
Polynomial Time ◽  
Transition System ◽  
Satisfiability Problem ◽  
Local Model ◽  
Transition Systems ◽  
Finite Systems ◽  
Soundness And Completeness ◽  
The Given ◽  
Local Model Checking

We present a <em>CTL</em>-like logic which is interpreted over labeled asynchronous transition systems. The interpretation reflects the desire to reason about these only with respect their progress fair behaviours. For finite systems we provide a set of tableau rules and prove soundness and completeness with respect to the given interpretation of our logic. We also provide a model checking algorithm which solves the model checking problem in deterministic polynomial time in the size of the formula and the labelled asynchronous transition system. We then consider different extensions of the logic with modalities expressing concurrent behaviour and investigate how this affects the decidability of the satisfiability problem.

scholarly journals Valid Arguments and Heyting Algebra using Multi Valued Logic

2020 ◽  
Vol 4 (5) ◽  
pp. 103-108
Keyword(s):  
Artificial Intelligence ◽  
Mathematical Logic ◽  
Heyting Algebra ◽  
Precise Solution ◽  
Logical Proposition ◽  
The Given ◽  
True False

Over last three decades, multi valued logic (MVL) has been receiving considerable attention. So, we focus our concentration upon multi valued logic using some of the rules of mathematical logic, which can be used in developing artificial intelligence. Since Aristotle’s logic there were only two propositions. Later it was extended to n-valued logical proposition which is greater than 2, that is popularly known as multi valued logic proposition – they are true, false and unknowns. In this paper we will discuss about multi valued logic with 27- possible using Jaina logic and some of the rules as it gives the best results. In Jaina Logic, indeterminant means something which cannot describe more than one aspect at a time. So, we are going to consider each aspect separately and assign True or False. Then according to the given condition we can either apply min or max condition to get a precise solution.

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.

Linguistic Data Model for Natural Languages and Artificial Intelligence. Part 5. Introduction to Logic

Discourse ◽  
2020 ◽  
Vol 6 (3) ◽  
pp. 109-117
Author(s):  
O. M. Polyakov
Keyword(s):  
Artificial Intelligence ◽  
Mathematical Logic ◽  
Natural Language ◽  
Semantic Interpretation ◽  
General View ◽  
World Model ◽  
Semantic Approach ◽  
Natural Languages ◽  
The World ◽  
Linguistic Aspect

Introduction. The article continues the series of publications on the linguistics of relations (hereinafter R–linguistics) and is devoted to an introduction to the logic of natural language in relation to the approach considered in the series. The problem of natural language logic still remains relevant, since this logic differs significantly from traditional mathematical logic. Moreover, with the appearance of artificial intelligence systems, the importance of this problem only increases. The article analyzes logical problems that prevent the application of classical logic methods to natural languages. This is possible because R-linguistics forms the semantics of a language in the form of world model structures in which language sentences are interpreted.Methodology and sources. The results obtained in the previous parts of the series are used as research tools. To develop the necessary mathematical representations in the field of logic and semantics, the formulated concept of the interpretation operator is used.Results and discussion. The problems that arise when studying the logic of natural language in the framework of R–linguistics are analyzed. These issues are discussed in three aspects: the logical aspect itself; the linguistic aspect; the aspect of correlation with reality. A very General approach to language semantics is considered and semantic axioms of the language are formulated. The problems of the language and its logic related to the most General view of semantics are shown.Conclusion. It is shown that the application of mathematical logic, regardless of its type, to the study of natural language logic faces significant problems. This is a consequence of the inconsistency of existing approaches with the world model. But it is the coherence with the world model that allows us to build a new logical approach. Matching with the model means a semantic approach to logic. Even the most General view of semantics allows to formulate important results about the properties of languages that lack meaning. The simplest examples of semantic interpretation of traditional logic demonstrate its semantic problems (primarily related to negation).

Sign in / Sign up

Export Citation Format

Share Document