{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:22Z","timestamp":1725663262904},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:29Z","timestamp":1330206149000},"page":"254-266","source":"Crossref","is-referenced-by-count":5,"title":["A predicate calculus with control of derivations"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Mey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"16_CR1","unstructured":"G. Boolos and R. Jeffrey. Computability and logic. Cambridge university press (1974)"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01625836","volume":"27","author":"J. Krajicek","year":"1988","unstructured":"J. Krajicek and P. Pudlak. The number of proof lines and the size of proofs in the first order logic. Archive for mathematical logic 27 (1988) 69\u201384","journal-title":"Archive for mathematical logic"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(84)90047-1","volume":"32","author":"J. Ketonen","year":"1984","unstructured":"J. Ketonen, R. Weyhrauch. A decidable fragment of predicate calculus. Theoretical computer science (TCS) 32 (1984) 297\u2013307","journal-title":"Theoretical computer science (TCS)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y. Girard","year":"1987","unstructured":"J-Y. Girard. Linear logic. TCS 50 (1987) 1\u2013101","journal-title":"TCS"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0014972","volume":"250","author":"J-Y. Girard","year":"1987","unstructured":"J-Y. Girard, Y. Lafont. Linear logic and lazy computation. Proceedings theory and practice of software development 1987 (H. Ehrig et al., editors). Lecture notes in computer science 250 (1987) 52\u201366","journal-title":"Lecture notes in computer science"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(88)90037-0","volume":"57","author":"A. Avron","year":"1988","unstructured":"A. Avron. The semantics and proof theory of linear logic. TCS 57 (1988) 161\u2013184","journal-title":"TCS"},{"key":"16_CR7","first-page":"393","volume":"45","author":"H. Ono","year":"1985","unstructured":"H. Ono and Y. Komori. Predicate logic without the structure rules. Studia logica 45 (1985) 393\u2013404.","journal-title":"Studia logica"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:19Z","timestamp":1619572159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}