A Completenes Theorem for an Infinitary Intutionistic Logic With Both Ordinary and Probability Quantifiers
A generalization of abstract model theory
A generalized Łoś ultraproduct theorem
A Logic of Approximate Reasoning
A Logic With Higher Order Probabilities
A reflection phenomenon in descriptive set theory
A rigid Boolean algebra that admits the elimination of Q21
Using ♢ , we construct a rigid atomless Boolean algebra that has no uncountable antichain and that admits the elimination of the Malitz quantifier .
Alcune osservazioni sul linguaggio
An existence theorem for 1-atomic standard models of (more weak than usual “atomic models”) and applications of to are the results of this note.
An intuitionistic logic with probablistic operators.
Anzahlquantoren in der Prädikatenlogik
Approximation theory of uniqueness conditions by existence conditions
Axiomatización de lógicas monádicas con varios cuantificadores cardinales
Barwise Completeness Theorems For Logics With Integrals
Classical logic with some probability operators.
Combinatorics and quantifiers
Let be the set of subsets of of cardinality . Let be a coloring of and a coloring of . We write if every -homogeneous is also -homogeneous. The least such that for some is called the -width of and denoted by . In the first part of the paper we prove the existence of colorings with high -width. In particular, we show that for each and there is a coloring with . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....
Compacidad Y Decibilidad De Logicas Monadicas Con Cuantificadores Cardinales.
Completeness Theorem for a Monadic Logic with Both First-order and Probability Quantifiers
Completeness theorem for probability models with finitely many valued measure in logic with integrals
Continuous Time Probability Logic
Craig Interpolation Theorem for Classical Propositional Logic with some Probability Operators