Results for 'Szabolcs Mikul'

31 found
Order:
  1.  16
    Taming Logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.
    In this paper, we introduce a general technology, calledtaming, for finding well-behaved versions of well-investigated logics. Further, we state completeness, decidability, definability and interpolation results for a multimodal logic, calledarrow logic, with additional operators such as thedifference operator, andgraded modalities. Finally, we give a completeness proof for a strong version of arrow logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  11
    Multichannel Investigation of Interoception: Sensitivity Is Not a Generalizable Feature.Eszter Ferentzi, Tamás Bogdány, Zsuzsanna Szabolcs, Barbara Csala, Áron Horváth & Ferenc Köteles - 2018 - Frontiers in Human Neuroscience 12.
  3. Történelemformáló Vulkánok.Harangi Szabolcs - forthcoming - História.
    No categories
     
    Export citation  
     
    Bookmark  
  4.  2
    Szabolcs Mikulas.Gabbay-Style Calculi - 1996 - In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer Academic Publishers. pp. 243.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  5. Mikul Dhuwur Mendhem Jero: Menyelami Falsafah Dan Kosmologi Jawa.Janmo Dumadi - 2011 - Pura Pustaka.
    Translate
     
     
    Export citation  
     
    Bookmark  
  6.  28
    Lambek Calculus and its Relational Semantics: Completeness and Incompleteness. [REVIEW]Hajnal Andréka & Szabolcs Mikulás - 1994 - Journal of Logic, Language and Information 3 (1):1-37.
    The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  7. Positive Fragments of Relevance Logic and Algebras of Binary Relations.Robin Hirsch & Szabolcs Mikulás - 2011 - Review of Symbolic Logic 4 (1):81-105.
    We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  14
    Notions of Density That Imply Representability in Algebraic Logic.Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi & András Simon - 1998 - Annals of Pure and Applied Logic 91 (2-3):93-190.
    Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable . This theorem and its analogues for quasi-polyadic algebras with and without equality are formulated in Henkin, Monk and Tarski [13]. We introduce a natural and more general notion of rectangular density that can be applied to arbitrary cylindric and quasi-polyadic algebras, not just atomic ones. We then show that every rectangularly dense cylindric algebra is representable, and we extend this result (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  9.  22
    On Representable Ordered Residuated Semigroups.Szabolcs Mikulás - 2011 - Logic Journal of the IGPL 19 (1):233-240.
    We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of substructural logics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  18
    Complexity of Equational Theory of Relational Algebras with Projection Elements.Szabolcs Mikulás, Ildikó Sain & Andras Simon - 1992 - Bulletin of the Section of Logic 21 (3):103-111.
    The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts of \ ’s, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  33
    Taming First-Order Logic.Szabolcs Mikulás - 1998 - Logic Journal of the IGPL 6 (2):305-316.
    In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12. Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables.Maarten Marx & Szabolcs Mikulás - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
    The aim of this paper is to give a new proof for the decidability and finite model property of first-order logic with two variables (without function symbols), using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two (Pse 2 ). The new proof also shows the known results that the universal theory of Pse 2 is decidable and that every finite Pse 2 can be represented on a finite (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  13.  57
    An Elementary Construction for a Non-Elementary Procedure.Maarten Marx & Szabolcs Mikulás - 2002 - Studia Logica 72 (2):253-263.
    We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for the product finite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, reflexivity and symmetry. We do not consider the transitivity condition in isolation because it leads to infinity axioms (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  69
    Categories, Prototypes and Memory Systems in Alzheimer's Disease.Szabolcs Kéri, Zoltán Janka, György Benedek, Péter Aszalós, Botond Szatmáry, Gábor Szirtes & András Lörincz - 2002 - Trends in Cognitive Sciences 6 (3):132-136.
  15.  2
    Ordered Domain Algebras.Robin Hirsch & Szabolcs Mikulás - 2013 - Journal of Applied Logic 11 (3):266-271.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  13
    Pre-Hunt Communication Provides Context for the Evolution of Early Human Language.Szabolcs Számadó - 2010 - Biological Theory 5 (4):366-382.
    The origin of human language is one of the most fascinating and most difficult problems of evolution. Here I argue that pre-hunt communication was the starting context of the evolution of human language. Hunting of big game created a shared interest; animals and hunting actions are easy to imitate; the need to plan created a pressure for increasing complexity; and finally, cultural inheritance of hunting tools and know-how made the transition unique. I further argue that this “first step” was actually (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  13
    On the Completeness of the Lambek Calculus with Respect to Relativized Relational Semantics.Nikolai Pankrat'ev - 1994 - Journal of Logic, Language and Information 3 (3):233-246.
    Recently M. Szabolcs [12] has shown that many substructural logics including Lambek CalculusL are complete with respect to relativized Relational Semantics. The current paper proves that it is sufficient forL to consider a relativization to the relation x dividesy in some fixed semigroupG.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  15
    Religious Conversion to Christianity in Muslim Refugees in Europe.Szabolcs Kéri & Christina Sleiman - 2017 - Archive for the Psychology of Religion 39 (3):283-294.
    _ Source: _Volume 39, Issue 3, pp 283 - 294 An increasing number of Muslim asylum seekers and refugees convert to Christianity in Europe. The conversion motifs in these individuals are unknown. In this study, we applied biographical interviews in 124 converts. There were two dominant patterns: intellectual —intellectual plus experimental motifs, and mystical —mystical plus affectional motifs. Pure experimental and affectional motifs were rare, and there were no revivalist and coercive motifs. Demographic parameters did not predict conversion motifs. We (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  19.  32
    The Notion of Incommensurability Can Be Extended to the Child's Developing Theories of Mind as Well.Szabolcs Kiss - 2011 - Behavioral and Brain Sciences 34 (3):134-135.
    In this commentary I argue that the notion of incommensurability can be extended to the child's developing theories of mind. I use Carey's concept of Quinian bootstrapping and show that this learning process can account for the acquisition of the semantics of mental terms. I suggest a distinction among three stages of acquisition and adopt the theory–theory of conceptual development.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20.  23
    Early Mouse Embryo Development: Could Epigenetics Influence Cell Fate Determination?Amandine Henckel, Szabolcs Tóth & Philippe Arnaud - 2007 - Bioessays 29 (6):520-524.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  34
    Undecidable Relativizations of Algebras of Relations.Szabolcs Mikulás & Maarten Marx - 1999 - Journal of Symbolic Logic 64 (2):747-760.
    In this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic.
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark  
  22.  21
    The Equational Theories of Representable Residuated Semigroups.Szabolcs Mikulás - 2015 - Synthese 192 (7):2151-2158.
    We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  14
    Complexity of Equational Theory of Relational Algebras with Standard Projection Elements.Szabolcs Mikulás, Ildikó Sain & András Simon - 2015 - Synthese 192 (7):2159-2182.
    The class $$\mathsf{TPA}$$ TPA of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of $$\mathsf{TPA}$$ TPA nor the first order theory of $$\mathsf{TPA}$$ TPA are decidable. Moreover, we show that the set of all equations valid in $$\mathsf{TPA}$$ TPA is exactly on the $$\Pi ^1_1$$ Π 1 1 level. We consider the class $$\mathsf{TPA}^-$$ (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  8
    Undecidable Relativizations of Algebras of Relations.Szabolcs Mikulas & Maarten Marx - 1999 - Journal of Symbolic Logic 64 (2):747-760.
    In this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  7
    Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables.Maarten Marx & Szabolcs Mikulas - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
    The aim of this paper is to give a new proof for the decidability and finite model property of first-order logic with two variables, using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two. The new proof also shows the known results that the universal theory of Pse$_2$ is decidable and that every finite Pse$_2$ can be represented on a finite base. Since the class Cs$_2$ of cylindric set (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  13
    On Canonicity and Completions of Weakly Representable Relation Algebras.Ian Hodkinson & Szabolcs Mikulás - 2012 - Journal of Symbolic Logic 77 (1):245-262.
    We show that the variety of weakly representable relation algebras is neither canonical nor closed under Monk completions.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  27.  14
    The Rise and Fall of Handicap Principle: A Commentary on the “Modelling and the Fall and Rise of the Handicap Principle”.Szabolcs Számadó - 2012 - Biology and Philosophy 27 (2):279-286.
    The honesty of animal communication is in the spot lights in the last 30 years. During most of this time the field was dominated by one explanation: Zahavi’s handicap principle (Zahavi, J Theor Biol 67:603–605, 1975 ; Grafen, J Theor Biol 144:517–546, 1990 ). Grose (Biol Philos 2011 ) embarks to explain both the success of the theory and the empirical difficulties that exist despite this success. While I wholeheartedly agree with the criticism offered by Grose and with almost all (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28.  6
    Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics.Szabolcs Mikulás - 2015 - Studia Logica 103 (3):453-478.
    We look at lower semilattice-ordered residuated semigroups and, in particular, the representable ones, i.e., those that are isomorphic to algebras of binary relations. We will evaluate expressions in representable algebras and give finite axiomatizations for several notions of validity. These results will be applied in the context of substructural logics.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  29. A Politikum Filozófiája: Bence György-Emlékkönyv.György Bence, Szabolcs Pogonyi, M. István Bodnár & Gábor Borbély (eds.) - 2010 - Gondolat.
    Translate
     
     
    Export citation  
     
    Bookmark  
  30. A Vallási Tapasztalat Megértése: Jog, Bölcselet, Teológia.Ferenc Bányai, Szabolcs Nagypál & Gergely Bakos (eds.) - 2010 - Békés Gellért Ökumenikus Intézet.
    Translate
     
     
    Export citation  
     
    Bookmark  
  31. Early-Stage Vision and Perceptual Imagery in Autism Spectrum Conditions.Rebeka Maróthi, Katalin Csigó & Szabolcs Kéri - 2019 - Frontiers in Human Neuroscience 13.