Combinatorial semantics:
Abstract: "In ordinary first order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accomodate inductive/uncertain/probabilistic/non-monotonic inference, we weaken that demand to the demand that the...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1992
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
444 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In ordinary first order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accomodate inductive/uncertain/probabilistic/non-monotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the premises are true. More generally, we say that an inference is [p, q] valid if it is true in a proportion lying between p and q of those models in which the premises are true. If we include a statistical variable binding operator '%' in our language, there are many quite general things we can say about uncertain validity." |
| Beschreibung: | 23 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015689 | ||
| 003 | DE-604 | ||
| 005 | 20150130 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)27652887 | ||
| 035 | |a (DE-599)BVBBV009015689 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kyburg, Henry Ely |d 1928-2007 |e Verfasser |0 (DE-588)128490950 |4 aut | |
| 245 | 1 | 0 | |a Combinatorial semantics |c Henry E. Kyburg |
| 264 | 1 | |a Rochester, NY |c 1992 | |
| 300 | |a 23 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 444 | |
| 520 | 3 | |a Abstract: "In ordinary first order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accomodate inductive/uncertain/probabilistic/non-monotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the premises are true. More generally, we say that an inference is [p, q] valid if it is true in a proportion lying between p and q of those models in which the premises are true. If we include a statistical variable binding operator '%' in our language, there are many quite general things we can say about uncertain validity." | |
| 650 | 4 | |a Knowledge representation (Information theory) | |
| 650 | 4 | |a Logic | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 444 |w (DE-604)BV008902697 |9 444 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005961236 | |
Datensatz im Suchindex
| _version_ | 1823939757745373184 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Kyburg, Henry Ely 1928-2007 |
| author_GND | (DE-588)128490950 |
| author_facet | Kyburg, Henry Ely 1928-2007 |
| author_role | aut |
| author_sort | Kyburg, Henry Ely 1928-2007 |
| author_variant | h e k he hek |
| building | Verbundindex |
| bvnumber | BV009015689 |
| ctrlnum | (OCoLC)27652887 (DE-599)BVBBV009015689 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV009015689</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150130</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27652887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015689</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kyburg, Henry Ely</subfield><subfield code="d">1928-2007</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128490950</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial semantics</subfield><subfield code="c">Henry E. Kyburg</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">444</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In ordinary first order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accomodate inductive/uncertain/probabilistic/non-monotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the premises are true. More generally, we say that an inference is [p, q] valid if it is true in a proportion lying between p and q of those models in which the premises are true. If we include a statistical variable binding operator '%' in our language, there are many quite general things we can say about uncertain validity."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge representation (Information theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">444</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">444</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961236</subfield></datafield></record></collection> |
| id | DE-604.BV009015689 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-13T11:01:41Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961236 |
| oclc_num | 27652887 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 23 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Kyburg, Henry Ely 1928-2007 Verfasser (DE-588)128490950 aut Combinatorial semantics Henry E. Kyburg Rochester, NY 1992 23 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 444 Abstract: "In ordinary first order logic, a valid inference in a language L is one in which the conclusion is true in every model of the language in which the premises are true. To accomodate inductive/uncertain/probabilistic/non-monotonic inference, we weaken that demand to the demand that the conclusion be true in a large proportion of the models in which the premises are true. More generally, we say that an inference is [p, q] valid if it is true in a proportion lying between p and q of those models in which the premises are true. If we include a statistical variable binding operator '%' in our language, there are many quite general things we can say about uncertain validity." Knowledge representation (Information theory) Logic Department of Computer Science: Technical report University of Rochester <Rochester, NY> 444 (DE-604)BV008902697 444 |
| spellingShingle | Kyburg, Henry Ely 1928-2007 Combinatorial semantics Knowledge representation (Information theory) Logic |
| title | Combinatorial semantics |
| title_auth | Combinatorial semantics |
| title_exact_search | Combinatorial semantics |
| title_full | Combinatorial semantics Henry E. Kyburg |
| title_fullStr | Combinatorial semantics Henry E. Kyburg |
| title_full_unstemmed | Combinatorial semantics Henry E. Kyburg |
| title_short | Combinatorial semantics |
| title_sort | combinatorial semantics |
| topic | Knowledge representation (Information theory) Logic |
| topic_facet | Knowledge representation (Information theory) Logic |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT kyburghenryely combinatorialsemantics |