Open AccessSequent Calculi for ‘Generally’
Author(s) -
Leonardo Bruno Vana,
Paulo A. S. Veloso,
Sheila R. M. Veloso
Publication year - 2008
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2008.03.065
Subject(s) - sequent , sequent calculus , cut elimination theorem , calculus (dental) , natural deduction , mathematics , algebra over a field , style (visual arts) , computer science , programming language , proof calculus , discrete mathematics , pure mathematics , mathematical proof , medicine , geometry , dentistry , history , archaeology
Logics of ‘generally’ (LG's) were introduced for handling assertions with some versions of vague notions (e.g. ‘generally’, ‘most’, ‘several’), which occur often in ordinary language and in science. LG's provide a framework for distinct notions of ‘generally’: one builds a specific logic for the notion one has in mind. We introduce deductive systems, in sequent calculus style, for LG's and we examine cut elimination
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom