{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:05:00Z","timestamp":1761894300601},"reference-count":47,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":7862,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1992,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>What is an inference rule? This question does not have a unique answer. One usually finds two distinct standard answers in the literature; validity inference (\u03c3 \u22a6<jats:sub><jats:italic>v<\/jats:italic><\/jats:sub>\u03c6 for every substitution \u03c4, the validity of \u03c4[\u03c3] entails the validity of \u03c4[\u03c6]), and truth inference (\u03c3\u22a6<jats:sub><jats:italic>l<\/jats:italic><\/jats:sub> \u03c6 if for every substitution \u03c4, the truth of \u03c4[\u03c3] entails the truth of \u03c4[\u03c6]). In this paper we introduce a general semantic framework that allows us to investigate the notion of inference more carefully. Validity inference and truth inference are in some sense the extremal points in our framework. We investigate the relationship between various types of inference in our general framework, and consider the complexity of deciding if an inference rule is sound, in the context of a number of logics of interest: classical propositional logic, a nonstandard propositional logic, various propositional modal logics, and first-order logic.<\/jats:p>","DOI":"10.2307\/2275447","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:45:35Z","timestamp":1146955535000},"page":"1018-1045","source":"Crossref","is-referenced-by-count":22,"title":["What is an inference rule?"],"prefix":"10.1017","volume":"57","author":[{"given":"Ronald","family":"Fagin","sequence":"first","affiliation":[]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200022519_ref047","doi-asserted-by":"publisher","DOI":"10.1007\/BF01475439"},{"key":"S0022481200022519_ref045","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210114"},{"key":"S0022481200022519_ref044","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210104"},{"key":"S0022481200022519_ref042","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"S0022481200022519_ref039","first-page":"121","volume-title":"Logic, methodology and philosophy of science. VIII","author":"Rybakov","year":"1989"},{"key":"S0022481200022519_ref038","doi-asserted-by":"publisher","DOI":"10.1070\/IM1987v028n03ABEH000902"},{"key":"S0022481200022519_ref037","doi-asserted-by":"publisher","DOI":"10.1070\/SM1987v056n02ABEH003038"},{"key":"S0022481200022519_ref036","doi-asserted-by":"publisher","DOI":"10.2307\/2214309"},{"key":"S0022481200022519_ref035","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200022519_ref034","volume-title":"Methods of logic","author":"Quine","year":"1950"},{"key":"S0022481200022519_ref031","first-page":"238","volume-title":"Automata, languages and programming, proceedings, Akko, 1979","volume":"125","author":"Meyer","year":"1981"},{"key":"S0022481200022519_ref026","first-page":"503","volume":"51","author":"Humberstone","year":"1986","journal-title":"A more discriminating approach to modal logic"},{"key":"S0022481200022519_ref024","volume-title":"A companion to modal logic","author":"Hughes","year":"1984"},{"key":"S0022481200022519_ref021","doi-asserted-by":"publisher","DOI":"10.2307\/2025471"},{"key":"S0022481200022519_ref019","volume-title":"Computers and intractibility: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"S0022481200022519_ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2977-2"},{"key":"S0022481200022519_ref017","volume-title":"Investigations in modal and tense logics","author":"Gabbay","year":"1976"},{"key":"S0022481200022519_ref016","first-page":"113","volume":"40","author":"Friedman","year":"1975","journal-title":"One hundred and two problems in mathematical logic"},{"key":"S0022481200022519_ref015","volume-title":"Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens","author":"Frege","year":"1879"},{"key":"S0022481200022519_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"S0022481200022519_ref011","first-page":"3","volume-title":"ICDT '90 (Proceedings of the 1990 international conference on database theory","volume":"470","author":"Fagin","year":"1990"},{"key":"S0022481200022519_ref009","doi-asserted-by":"publisher","DOI":"10.4064\/fm-49-2-129-141"},{"key":"S0022481200022519_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5203-4_3"},{"key":"S0022481200022519_ref043","first-page":"1","volume":"52","author":"Stockmeyer","year":"1987","journal-title":"Classifying the computational complexity of problems"},{"key":"S0022481200022519_ref007","first-page":"36","volume":"44","author":"Cook","year":"1979","journal-title":"The relative efficiency of propositional proof systems"},{"key":"S0022481200022519_ref004","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192"},{"key":"S0022481200022519_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90023-U"},{"key":"S0022481200022519_ref001","volume-title":"Entailment: the logic of relevance and necessity","author":"Anderson","year":"1975"},{"key":"S0022481200022519_ref030","doi-asserted-by":"publisher","DOI":"10.1007\/BF01084082"},{"key":"S0022481200022519_ref029","volume-title":"Symbolic logic","author":"Lewis","year":"1959"},{"key":"S0022481200022519_ref012","first-page":"41","volume-title":"Theoretical aspects of reasoning about knowledge (proceedings of the third conference, Pacific Grove, California, 1990","author":"Fagin","year":"1990"},{"key":"S0022481200022519_ref025","volume-title":"Introduction to automata theory, languages and computation","author":"Hopcroft","year":"1979"},{"key":"S0022481200022519_ref041","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(90)90055-7"},{"key":"S0022481200022519_ref023","volume-title":"An introduction to modal logic","author":"Hughes","year":"1978"},{"key":"S0022481200022519_ref032","first-page":"115","volume-title":"Proceedings of the 20th IEEE symposium on foundations of computer science","author":"Pratt","year":"1979"},{"key":"S0022481200022519_ref005","volume-title":"Introduction to mathematical logic","volume":"I","author":"Church","year":"1956"},{"key":"S0022481200022519_ref006","first-page":"151","volume-title":"Proceedings of the third ACM symposium on theory of computing","author":"Cook","year":"1971"},{"key":"S0022481200022519_ref046","first-page":"314","article-title":"On admissible rules of intuitionistic propositional calculus","volume":"102","author":"Tsitkin","year":"1977","journal-title":"Matematicheskit Sbornik"},{"key":"S0022481200022519_ref040","doi-asserted-by":"publisher","DOI":"10.1007\/BF00935600"},{"key":"S0022481200022519_ref033","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90068-0"},{"key":"S0022481200022519_ref022","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.cs.02.060187.000345"},{"key":"S0022481200022519_ref010","volume-title":"A mathematical introduction to logic","author":"Enderton","year":"1972"},{"key":"S0022481200022519_ref020","unstructured":"Goranko V. and Passy S. , Using the universal modality: profits and questions, unpublished manuscript, 1989."},{"key":"S0022481200022519_ref014","first-page":"35","article-title":"Sur quelques classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publications Scientifiques de l'Universit\u00e9 d'Alger"},{"key":"S0022481200022519_ref003","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.1979.tb00794.x"},{"key":"S0022481200022519_ref028","doi-asserted-by":"publisher","DOI":"10.1137\/0206033"},{"key":"S0022481200022519_ref027","first-page":"756","volume":"52","author":"Kapron","year":"1987","journal-title":"Modal sequents and definability"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200022519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T21:01:45Z","timestamp":1558040505000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200022519\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["S0022481200022519"],"URL":"https:\/\/doi.org\/10.2307\/2275447","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}