17 found
Sort by:
  1. M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
    We investigate theories of initial segments of the standard models for arithmetics. It is easy to see that if the ordering relation is definable in the standard model then the decidability results can be transferred from the infinite model into the finite models. On the contrary we show that the Σ₂—theory of multiplication is undecidable in finite models. We show that this result is optimal by proving that the Σ₁—theory of multiplication and order is decidable in finite models as well (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. M. Krynicki (1995). Henkin Quantifiers,[W:] Krynicki M., Mostowski M., Szczerba LW (Red.). In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers.
    No categories
     
    My bibliography  
     
    Export citation  
  3. Michał Krynicki (1995). Quantifiers Determined by Classes of Binary Relations. In. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. 125--138.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Michał Krynicki (1993). Hierarchies of Partially Ordered Connectives and Quantifiers. Mathematical Logic Quarterly 39 (1):287-294.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Michał Krynicki & Marcin Mostowski (1992). Decidability Problems in Languages with Henkin Quantifiers. Annals of Pure and Applied Logic 58 (2):149-172.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Lauri Hella & Michal Krynicki (1991). Remarks on The Cartesian Closure. Mathematical Logic Quarterly 37 (33‐35):539-545.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Heinrich Herre, Michał Krynicki, Alexandr Pinus & Jouko Väänänen (1991). The Härtig Quantifier: A Survey. Journal of Symbolic Logic 56 (4):1153-1183.
    A fundamental notion in a large part of mathematics is the notion of equicardinality. The language with Hartig quantifier is, roughly speaking, a first-order language in which the notion of equicardinality is expressible. Thus this language, denoted by LI, is in some sense very natural and has in consequence special interest. Properties of LI are studied in many papers. In [BF, Chapter VI] there is a short survey of some known results about LI. We feel that a more extensive exposition (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Michał Krynicki & Hans-Peter Tuschik (1991). An Axiomatization of the Logic with the Rough Quantifier. Journal of Symbolic Logic 56 (2):608-617.
  9. Michal Krynicki (1990). Quantifiers Determined by Partial Orderings. Mathematical Logic Quarterly 36 (1):79-86.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Michał Krynicki & Lesław Szczerba (1990). On Simplicity of Formulas. Studia Logica 49 (3):401 - 419.
    Simple formula should contain only few quantifiers. In the paper the methods to estimate quantity and quality of quantifiers needed to express a sentence equivalent to given one.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Michael Krynicki & Jouko Väänänen (1989). Henkin and Function Quantifiers. Annals of Pure and Applied Logic 43 (3):273-292.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Michal Krynicki (1988). Notion of Interpretation and Nonelementary Languages. Mathematical Logic Quarterly 34 (6):541-552.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Michal Krynicki (1988). The Non-Definability Notion and First Order Logic. Studia Logica 47 (4):429 - 437.
    The theorem to the effect that the languageL introduced in [2] is mutually interpretable with the first order language is proved. This yields several model-theoretical results concerningL.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  14. Adam Gajda, Michał Krynicki & Lesław Szczerba (1987). A Note on Syntactical and Semantical Functions. Studia Logica 46 (2):177 - 185.
    We say that a semantical function is correlated with a syntactical function F iff for any structure A and any sentence we have A F A .It is proved that for a syntactical function F there is a semantical function correlated with F iff F preserves propositional connectives up to logical equivalence. For a semantical function there is a syntactical function F correlated with iff for any finitely axiomatizable class X the class –1X is also finitely axiomatizable (i.e. iff is (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  15. Michal Krynicki (1987). On Some Applications of Games for Härtig Quantifier. Mathematical Logic Quarterly 33 (4):359-370.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Michał Krynicki, Alistair Lachlan & Jouko Väänänen (1984). Vector Spaces and Binary Quantifiers. Notre Dame Journal of Formal Logic 25 (1):72-78.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. Michał Krynicki & Alistair H. Lachlan (1979). On the Semantics of the Henkin Quantifier. Journal of Symbolic Logic 44 (2):184-200.