Partial up and down logic:
Abstract: "This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949]. We provide simple se...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,11 |
| Subjects: | |
| Summary: | Abstract: "This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949]. We provide simple semantics, sequential calculi, completeness and decidability proofs." |
| Physical Description: | 22 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010176497 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950510s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)33099200 | ||
| 035 | |a (DE-599)BVBBV010176497 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Jaspars, Jan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Partial up and down logic |c J. Jaspars |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,11 | |
| 520 | 3 | |a Abstract: "This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949]. We provide simple semantics, sequential calculi, completeness and decidability proofs." | |
| 650 | 4 | |a Knowledge representation (Information theory) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,11 |w (DE-604)BV008928356 |9 95,11 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759178 | ||
Record in the Search Index
| _version_ | 1804124573970464768 |
|---|---|
| any_adam_object | |
| author | Jaspars, Jan |
| author_facet | Jaspars, Jan |
| author_role | aut |
| author_sort | Jaspars, Jan |
| author_variant | j j jj |
| building | Verbundindex |
| bvnumber | BV010176497 |
| ctrlnum | (OCoLC)33099200 (DE-599)BVBBV010176497 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01289nam a2200277 cb4500</leader><controlfield tag="001">BV010176497</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33099200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010176497</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="100" ind1="1" ind2=" "><subfield code="a">Jaspars, Jan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Partial up and down logic</subfield><subfield code="c">J. Jaspars</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,11</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949]. We provide simple semantics, sequential calculi, completeness and decidability proofs."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge representation (Information theory)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,11</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759178</subfield></datafield></record></collection> |
| id | DE-604.BV010176497 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759178 |
| oclc_num | 33099200 |
| open_access_boolean | |
| physical | 22 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Jaspars, Jan Verfasser aut Partial up and down logic J. Jaspars Amsterdam 1995 22 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,11 Abstract: "This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949]. We provide simple semantics, sequential calculi, completeness and decidability proofs." Knowledge representation (Information theory) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,11 (DE-604)BV008928356 95,11 |
| spellingShingle | Jaspars, Jan Partial up and down logic Knowledge representation (Information theory) |
| title | Partial up and down logic |
| title_auth | Partial up and down logic |
| title_exact_search | Partial up and down logic |
| title_full | Partial up and down logic J. Jaspars |
| title_fullStr | Partial up and down logic J. Jaspars |
| title_full_unstemmed | Partial up and down logic J. Jaspars |
| title_short | Partial up and down logic |
| title_sort | partial up and down logic |
| topic | Knowledge representation (Information theory) |
| topic_facet | Knowledge representation (Information theory) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT jasparsjan partialupanddownlogic |