Abstract
The paper discusses the problem of representing and combining inference systems for (abstract) context institutions, within the framework of context presentations [10]. As it turns out, thanks to the context information present in this setting, the inference rules for quantifier logics can be expressed and manipulated in a simple way, without referring to binding operators or requirements (cf. [12]).
This research has been partially supported by the KBN grant No. 7 T11C 002 21.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Borceux, F.: Handbook of Categorical Algebra 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications, vol. 50. Cambridge University Press, Cambridge (1994)
Caleiro, C., Gouveia, P., Ramos, J.: Completeness results for fibered parchments. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 185–200. Springer, Heidelberg (2003)
Caleiro, C., Mateus, P., Ramos, J., Sernadas, A.: Combining logics: Parchments revisited. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, pp. 48–70. Springer, Heidelberg (2002)
Goguen, J.A., Burstall, R.M.: A study in the foundations of programming methodology: Specifications, institutions, charters and parchments. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 313–333. Springer, Heidelberg (1986)
Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39, 95–146 (1992)
Mossakowski, T.: Using limits of parchments to systematically construct institutions of partial algebras. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 379–393. Springer, Heidelberg (1996)
Mossakowski, T., Tarlecki, A., Pawłowski, W.: Combining and representing logical systems. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol. 1290, pp. 177–198. Springer, Heidelberg (1997)
Mossakowski, T., Tarlecki, A., Pawłowski, W.: Combining and representing logical systems using model-theoretic parchments. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 349–364. Springer, Heidelberg (1998)
Pawłowski, W.: Contextual Logical Systems for the Foundations of Software Specification and Development (in Polish). PhD thesis, Institute of Computer Science, Polish Academy of Sciences, Warsaw (2000)
Pawłowski, W.: Presentations for abstract context institutions. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, pp. 256–279. Springer, Heidelberg (2002)
Sernadas, A., Sernadas, C., Caleiro, C.: Fibring of logics as a categorial construction. Journal of Logic and Computation 9(2), 149–179 (1999)
Sernadas, A., Sernadas, C., Caleiro, C., Mossakowski, T.: Categorical fibring of logics with terms and binding operators. In: Gabbay, D., de Rijke, M. (eds.) Frontiers of Combining Systems 2, pp. 295–316. Research Studies Press, Hertfordshire (2000)
Stoughton, A.: Substitution revisited. Theoretical Computer Science 59, 317–325 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawłowski, W. (2003). Presenting and Combining Inference Systems. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds) Recent Trends in Algebraic Development Techniques. WADT 2002. Lecture Notes in Computer Science, vol 2755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40020-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-40020-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20537-1
Online ISBN: 978-3-540-40020-2
eBook Packages: Springer Book Archive