84 research outputs found

    List of publications by Ferenc GĂ©cseg

    Get PDF

    Foreword

    Get PDF

    Acta Cybernetica : Volume 14. Number 1.

    Get PDF

    Acta Cybernetica : Volume 18. Number 1.

    Get PDF

    Pragmatic markers in Hungarian: Some introductory remarks

    Get PDF
    The purpose of these introductory remarks is to complement the following case studies by Ferenc Kiefer on majd ‘later (on), sooner or later’, Attila PĂ©teri on hadd ‘let’, and IldikĂł VaskĂł on persze ‘of course’. What we will do is sketch a number of what we consider promising theoretical developments that have a bearing on the issues raised in these studies. In a section addressing issues of form (section 2), we discuss “cartographic” approaches to adverb(ial) hierarchies and the clausal “left periphery”, as well as pragmatic markers within clause types. In a section focusing on issues of interpretation (section 3), we deal with pragmatic markers from the perspective of “projective meaning” and “conversational moves”

    AUSz: Acta Bibliothecaria Tomus VI.

    Get PDF

    Pragmatic markers in Hungarian: Some introductory remarks

    Full text link

    Acta Cybernetica : Tomus 8. Fasciculus 4.

    Get PDF

    Herbrand-Confluence for Cut Elimination in Classical First Order Logic

    Get PDF
    We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs. We analyze which witnesses they choose for which quantifiers, or in other words: we only consider the Herbrand-disjunction of a cut-free proof. Our main theorem is a confluence result for a natural class of proofs: all (possibly infinitely many) normal forms of the non-erasing reduction lead to the same Herbrand-disjunction

    Herbrand-Confluence for Cut Elimination in Classical First Order Logic

    Get PDF
    International audienceWe consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs. We analyze which witnesses they choose for which quantifiers, or in other words: we only consider the Herbrand-disjunction of a cut-free proof. Our main theorem is a confluence result for a natural class of proofs: all (possibly infinitely many) normal forms of the non-erasing reduction lead to the same Herbrand-disjunction
    • 

    corecore