Indicative propositions.
Displaying 41 – 60 of 150
Indicators, recursive saturation and expandability
L. Kirby, K. McAllon, R. Murawski (1981)
Fundamenta Mathematicae
Indiscernibles and dimensional compactness
C. Ward Henson, Pavol Zlatoš (1996)
Commentationes Mathematicae Universitatis Carolinae
This is a contribution to the theory of topological vector spaces within the framework of the alternative set theory. Using indiscernibles we will show that every infinite set in a biequivalence vector space , such that for distinct , contains an infinite independent subset. Consequently, a class is dimensionally compact iff the -equivalence is compact on . This solves a problem from the paper [NPZ 1992] by J. Náter, P. Pulmann and the second author.
Indiscernibles in the alternative set theory
Antonín Sochor, Alena Vencovská (1981)
Commentationes Mathematicae Universitatis Carolinae
Individualised normative logic
Jan Štěpán (1989)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Induced pseudoorders
Ivan Chajda, Miroslav Haviar (1991)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Induction and decision procedures.
Deepak Kapur, Jürgen Giesl, Mahadevan Subramaniam (2004)
RACSAM
Mechanization of inductive reasoning is an exciting research area in artificial intelligence and automated reasoning with many challenges. An overview of our work on mechanizing inductive reasoning based on the cover set method for generating induction schemes from terminating recursive function definitions and using decision procedures is presented. This paper particularly focuses on the recent work on integrating induction into decision procedures without compromising their automation.
Inequivalence of the fragments of new foundations.
Urs Oswald (1981)
Archiv für mathematische Logik und Grundlagenforschung
Inessential combinations and colorings of models.
Sudoplatov, S.V. (2003)
Sibirskij Matematicheskij Zhurnal
Inf-datalog, modal logic and complexities
Eugénie Foustoucos, Irène Guessarian (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...
Inf-datalog, Modal Logic and Complexities
Eugénie Foustoucos, Irène Guessarian (2007)
RAIRO - Theoretical Informatics and Applications
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...
Inference in Action
Johan van Benthem (2007)
Publications de l'Institut Mathématique
Inference in conditional probability logic
Niki Pfeifer, Gernot D. Kleiter (2006)
Kybernetika
An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if ..., then ...” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is not necessarily...
Inference in expert systems based on complete multivalued logic
Jiří Ivánek, Josef Švenda, Jan Ferjenčík (1989)
Kybernetika
Inference rules with metavariables and logical equations in the pretabular modal logic PM1.
Kiyatkin, V.R. (2000)
Siberian Mathematical Journal
Infinitary equivalence of abelian groups
Paul Eklof (1974)
Fundamenta Mathematicae
Infinitary Simultaneous Recursion Theorem.
D. Vaggione (2008)
Mathware and Soft Computing
Infinitary stationary logic and abelian groups
Paul Eklof, Allan Mekler (1981)
Fundamenta Mathematicae
Infinitary varieties of structures closed under the formation of complex structures
G. Grätzer, S. Whitney (1984)
Colloquium Mathematicae
Infinite asymptotic games
Christian Rosendal (2009)
Annales de l’institut Fourier
We study infinite asymptotic games in Banach spaces with a finite-dimensional decomposition (F.D.D.) and prove that analytic games are determined by characterising precisely the conditions for the players to have winning strategies. These results are applied to characterise spaces embeddable into sums of finite dimensional spaces, extending results of Odell and Schlumprecht, and to study various notions of homogeneity of bases and Banach spaces. The results are related to questions of rapidity...