This is TikiWiki v1.9.8.3 -Sirius- © 2002–2007 by the Tiki community Fri 22 of Nov, 2024 [14:01 UTC]
Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats

Category F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

Browse in:
All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles

search category: deep:

Hide subcategories objects

Current category: Top  ::  ITHEA Classification Structure  ::  F. Theory of Computation  ::  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
..
 

Objects (17)

F.4.1 Mathematical Logic Article A GEOMETRICAL INTERPRETATION TO DEFINE CONTRADICTION Abstract: For inference purposes in both classical and fuzzy logic, neither the information itself should be contradictory, nor should any of the items of available information contradict each other. 
F.4.1 Mathematical Logic Article ACCOUNTING IN THEORETICAL GENETICS Abstract: We present a logical tool which allows understanding the rationality of the translation underlying some interactions in Nature. In an abstract, formal way, we can demonstrate the epistemol 
F.4.1 Mathematical Logic Article ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC DYNAMICS OF ... Abstract: This work deals in the usage of fractal analysis to determine the trend of dynamic characteristics of chaotic series based on R/S-analysis. We propose an algorithm using the method of dyna 
F.4.1 Mathematical Logic Article COMPARISON OF PROOF SIZES IN FREGE SYSTEMS AND SUBSTITUTION FREGE SYSTEMS Abstract: It is known that the minimal number of the steps in a proof of a tautology in a Frege system can be exponentially larger than in a substitution Frege system, but it is an open problem wheth 
F.4.1 Mathematical Logic Article CONTRADICTION VERSUS SELFCONTRADICTION IN FUZZY LOGIC* Abstract: Trillas et al. introduced in [7] and [8] the concepts of both self-contradictory fuzzy set and contradiction between two fuzzy sets. Later, in [1] and [2] the necessity of determine not o 
F.4.2 Grammars and Other Rewriting Systems Article DERIVATION OF CONTEXT-FREE STOCHASTIC L-GRAMMAR RULES ... Abstract: Formal grammars can used for describing complex repeatable structures such as DNA sequences. In this paper, we describe the structural composition of DNA sequences using a context-free stoc 
F.4.3 Formal Languages Article GENERALIZED AXIOMATIC APPROACH TO THE PARETO SET NARROWING Abstract: An axiomatic approach to solve the problem of narrowing the Pareto set based on some numerical information regarding preferences of the decision maker is considered. This approach has been  
F.4.3 Formal Languages Article Generalized Axiomatic Approach to the Pareto Set Narrowing Abstract: An axiomatic approach to solve the problem of narrowing the Pareto set based on some numerical information regarding preferences of the decision maker is considered. This approach has been  
F.4.0 General Article NON-LINEAR NETWORK-FLOW MODEL OF ŁUKASIEWICZ’S MULTIVALUE LOGIC Abstract: The paper presents a new network-flow interpretation of Łukasiewicz’s logic based on models with an increased effectiveness. The obtained results show that the presented network-flow mod 
F.4.1 Mathematical Logic Article ON PROBLEM OF ADEQUACY OF MULTISET MATHEMATICAL MODELS Abstract: The analysis of adequacy of competitiveness assessments based only on the values of multiplicity function of multiset is made. Such assessments are not adequate according to representation 
F.4.1 Mathematical Logic Article PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT ... Abstract: In this paper the proof complexities of some classes of quasi-hard determinable (Tsgfn ) and hard determinable ( n ) formulas are investigated in some refutation propositional systems. I 
F.4.1 Mathematical Logic Article PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT ... Abstract: In this paper the proof complexities of some classes of quasi-hard determinable (Tsgf n ) and hard determinable (ψ n ) formulas are investigated in some refutation propositional systems. I 
F.4.1 Mathematical Logic Article UNIVERSAL AND DETERMINED CONSTRUCTORS OF MULTISETS OF OBJECTS Abstract: This paper contains analysis of creation of sets and multisets as an approach for modeling of some aspects of human thinking. The creation of sets is considered within constructive object-o 
F.4.3 Formal Languages Article АКСИОМАТИЧЕСКИЙ ПОДХОД К СУЖЕНИЮ МНОЖЕСТВА Аннотация: Обсуждаются вычислительные аспекты аксиоматического подхода к решению проблемы сужения множест 
F.4.1 Mathematical Logic Article МОДАЛЬНЫЕ ЛОГИКИ ЧАСТИЧНЫХ ПРЕДИКАТОВ И СЕ� Аннотация: Исследованы программно-ориентированные логические формализмы – транзиционные композиционно-но 
F.4.1 Mathematical Logic Article СЕМАНТИЧЕСКИЕ СВОЙСТВА И СЕКВЕНЦИАЛЬНЫЕ ИС Аннотация: Исследованы чистые первопорядковые композиционно-номинативные логики частичных однозначных пр� 
F.4.3 Formal Languages Article СУЖЕНИЕ МНОЖЕСТВА ПАРЕТО НА ОСНОВЕ НЕЧЁТКОЙ ИНФОРМАЦИИ Аннотация: Обсуждается аксиоматический подход к решению проблемы сужения множества Парето на основе нечётк 

Page: 1/1
1  
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.21 secs ]   [ Memory usage: 9.10MB ]   [ GZIP Disabled ]   [ Server load: 0.69 ]