نتایج جستجو برای: implicational modifications

تعداد نتایج: 74492  

Agustin Tristán Parisa Daftarifard

In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...

Journal: :Notre Dame Journal of Formal Logic 2002

Journal: :Computación Y Sistemas 2022

In this paper, some implicational fragments of trivalent ?ukasiewicz logic are studied and the propositional first-order presented. The maximal consistent theories as Monteiro’s deductive systems Lindenbaum-Tarski algebra in both cases. Consequently, adequacy theorems with respect to suitable algebraic structures proven.

Journal: :Electr. J. Comb. 2013
Masataka Nakamura Kenji Kashiwabara

A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair (X, e) of a subset X, called a stem, and an element e 6∈ X, called a root. We introduce a notion called a ‘prime stem,’ which plays the key role in this article. Every prime stem is shown to be a ps...

2014
Vincent Aravantinos Sofiène Tahar

Reducing the distance between informal and formal proofs in interactive theorem proving is a long-standing matter. An approach to this general topic is to increase automation in theorem provers: indeed, automation turns many small formal steps into one big step. In spite of the usual automation methods, there are still many situations where the user has to provide some information manually, whe...

1998
Christian G. Fermüller

1 Implicational completeness-a neglected topic Every serious computer scientist and logician knows that resolution is complete for rst-order clause logic. By this, of course, one means that the empty clause (representing contradiction) is derivable by resolution from every unsatissable set of clauses S. However, there is another { less well known { concept of completeness for clause logic, that...

1994
Jingde Cheng

A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot automatically generate new and valid reasoning rules from those existing rules and facts that are programmed or inputted in the systems by their developers or users. ...

Journal: :The Quarterly journal of experimental psychology. A, Human experimental psychology 2001
S K Scott P J Barnard J May

The Interacting Cognitive Subsystems framework, ICS (Barnard, 1985) proposes that central executive phenomena can be accounted for by two autonomous subsystems, which process different forms of meaning: propositional and schematic (implicational) meanings. The apparent supervisory role of the executive arises from limitations on the exchange of information between these and other cognitive subs...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید