Completeness proofs for propositional logic with polynomial-time connectives
- Author
- CROSSLEY, J. N1 ; SCOTT, P. J
[1] Monash univ., dep. mathematics, Clayton Victoria 3168, Australia - Conference name
- Asian conference in mathematical logic. 3 (1987)
- Source
Annals of pure and applied logic. 1989, Vol 44, Num 1-2, pp 39-52 ; ref : 11 ref
- CODEN
- APALD7
- ISSN
- 0168-0072
- Scientific domain
- Computer science; Mathematics
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Conference Paper
- Language
- English
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02A Mathematical logic, foundations, set theory / 001A02A01 Logic and foundations
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 6667015
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/0168-0072(89)90044-4 
https://dx.doi.org/10.1016/0168-0072(89)90044-4
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Annals of pure and applied logic\";s:9:\"\u0000*\u0000stitle\";s:21:\"Ann. pure appl. logic\";s:7:\"\u0000*\u0000date\";s:4:\"1989\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"52\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0168-0072\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"CROSSLEY\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"SCOTT, P. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"APALD7\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Annals of pure and applied logic\";s:9:\"\u0000*\u0000stitle\";s:21:\"Ann. pure appl. logic\";s:7:\"\u0000*\u0000date\";s:4:\"1989\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"52\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0168-0072\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"CROSSLEY\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"SCOTT, P. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"APALD7\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Annals of pure and applied logic\";s:9:\"\u0000*\u0000stitle\";s:21:\"Ann. pure appl. logic\";s:7:\"\u0000*\u0000date\";s:4:\"1989\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"52\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0168-0072\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"CROSSLEY\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"SCOTT, P. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"APALD7\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Annals of pure and applied logic\";s:9:\"\u0000*\u0000stitle\";s:21:\"Ann. pure appl. logic\";s:7:\"\u0000*\u0000date\";s:4:\"1989\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"52\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0168-0072\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"CROSSLEY\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"SCOTT, P. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"APALD7\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0168-0072(89)90044-4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Annals of pure and applied logic\";s:9:\"\u0000*\u0000stitle\";s:21:\"Ann. pure appl. logic\";s:7:\"\u0000*\u0000date\";s:4:\"1989\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:2:\"39\";s:8:\"\u0000*\u0000epage\";s:2:\"52\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0168-0072\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"CROSSLEY\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. N\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"SCOTT, P. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"APALD7\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:76:\"Completeness proofs for propositional logic with polynomial-time connectives\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
