- phone:
- (570) 524-0989
- fax:
- (570) 286-3011
- email:
- cpinter@bucknell.edu

- Born: March 5, 1938 — Budapest, Hungary
- Schooling: Lycée Saint Aulaire, Tangier, Morocco

Lycée Regnault, Tangier, Morocco

- University of Paris, France, Docteur ès Sciences (Doctorat d'Etat, the prestigious “state doctorate” requiring two dissertations), 1964.
- Columbia University, New York, B.Sc. 1957.

- Professor Emeritus — Bucknell University, Lewisburg, PA. 2006-present
- Full Professor — Bucknell University, Lewisburg, PA. 1972 - 2006
- Fullbright Professor — Saint Marcos University, Lima, Peru. June - September 1980
- Visiting Scientist & Professor — University of Campinas, Brazil. June - September 1976
- Visiting Scientist & Professor — University of Sao Paulo, Brazil. June - September 1975
- NSF Post-doctoral Fellow — University of California, Berkeley. 1971-1972
- Fullbright Visiting Professor — University of Malaya, Kuala Lumpur. 1966-1967
- Associate Professor — Bucknell University, Lewisburg, PA. 1965-1966, 1967-1971
- Instructor — Universtiy of Maryland extension. 1959-1963

- Mathematical psychology
- Mathematical tools & models in neuroscience
- Information-theoretic methods in neuroscience.
- Neural networks (theory and design)
- Automatic and natural learning models
- Algebraic logic and applications to model theory

I have worked for many years on mathematical modeling — both the theory and methodology. More recently, my interest has turned to the specific problems involved in modeling structures arising in neuroscience. I am interested in perceptual mechanisms and especially the process of perceptual learning. I have worked on the theoretical aspects of training neural networks and have presented my results in three conference proceedings: ALT (Algorithmic Learning Theory) 1995, CCC (Coding, Cryptography and Combinatorics) 2003, and Eurocomb 2003. My work relates to both artificial and natural learning: I am interested both in how perceptual codes are acquired phylogenetically and how these same codes undergo further development as a result of perceptual learning by individuals.

Another problem of considerable interest to me is the fact that animal vision is invariably in the form of comprehensive, integrated perceptual groups or scenes — never of isolated single objects. In fact, when vision of extended displays fails, this is a token of severe pathology. This aspect of animal vision — the fact that multiple objects are perceived simultaneously — is profoundly mysterious, and has been almost entirely neglected in current research.

- Pinter, Charles C. Stone Space of Cylindric Algebras and Topological Model Spaces
*Journal of Symbolic Logic*, (to appear 2016) - MR2090657 Pinter, Charles C. Combinatorial tableaux in isoperimetry.
*Coding, cryptography and combinatorics,*289--301, Progr. Comput. Sci. Appl. Logic, 23,*Birkhäuser, Basel,*2004. (Reviewer: Jason Douglas Rosenhouse)- MathSciNet (may require login)

- MR1389824 Pinter, Charles C. Complexity of network training for classes of neural networks.
*Algorithmic learning theory (Fukuoka, 1995),*215--227, Lecture Notes in Comput. Sci., 997,*Springer, Berlin,*1995.- MathSciNet (may require login)

- MR0644983 Pinter, Charles C. A book of abstract algebra. Bonner Mathematische Schriften [Bonn Mathematical Publications], 135.
*McGraw-Hill Book Co., New York,*1982. xv+351 pp. ISBN: 0-07-050130-0 (Reviewer: James K. Deveney)- MathSciNet (may require login)

- MR0603672 Pinter, Charles The logic of inherent ambiguity.
*Proceedings of the Third Brazilian Conference on Mathematical Logic (Inst. Math., Fed. Univ. Pernambuco, Recife, 1979),*pp. 253--262,*Soc. Brasil. Lógica, S ao Paulo,*1980. (Reviewer: N. C. A. da Costa)- MathSciNet (may require login)

- MR0573952 Pinter, Charles C. Topological duality theory in algebraic logic.
*Mathematical logic in Latin America (Proc. IV Latin Amer. Sympos. Math. Logic, Santiago, 1978),*pp. 255--266, Stud. Logic Foundations Math., 99,*North-Holland, Amsterdam-New York,*1980. (Reviewer: D. Monk)- MathSciNet (may require login)

- MR0477283 Pinter, Charles A note on the decomposition of theories with respect to amalgamation, convexity, and related properties.
*Notre Dame J. Formal Logic***19**(1978), no. 1, 115--118. (Reviewer: A. M. W. Glass)- MathSciNet (may require login)

- MR0510986 Pinter, Charles C. Cylindric algebras with a property of Rasiowa and Sikorski.
*Mathematical logic (Proc. First Brazilian Conf., State Univ. Campinas, Campinas, 1977),*pp. 225--231, Lecture Notes in Pure and Appl. Math., 39,*Dekker, New York,*1978. (Reviewer: D. Monk)- MathSciNet (may require login)

- MR0511701 Pinter, Charles C. Properties preserved under definitional equivalence and interpretations.
*Z. Math. Logik Grundlag. Math.***24**(1978), no. 6, 481--488. (Reviewer: W. Schwabhauser)- MathSciNet (may require login)

- MR0505433 Pinter, Charles C. Some theorems on omitting types, with applications to model completeness, amalgamation, and related properties.
*Non-classical logics, model theory and computability (Proc. Third Latin-Amer. Sympos. Math. Logic, Campinas, 1976),*pp. 223--238. Studies in Logic and Foundations of Math., Vol. 89,*North-Holland, Amsterdam,*1977.- MathSciNet (may require login)

- MR0505222 da Costa, Newton C. A.; Pinter, Charles C. $\alpha $-logic and infinitary languages.
*Z. Math. Logik Grundlagen Math.***22**(1976), no. 2, 105--112.- MathSciNet (may require login)

- MR0419226 Pinter, Charles C. On the structure of Lindenbaum algebras: an approach using algebraic logic.
*Proc. Amer. Math. Soc.***56**(1976), 267--271. (Reviewer: Pierre-Francois Jurie)- MathSciNet (may require login)
- JSTOR (may require login)

- MR0392501 Pinter, Charles C. Algebraic logic with generalized quantifiers.
*Notre Dame J. Formal Logic***16**(1975), no. 4, 511--516. (Reviewer: M. Yasuhara)- MathSciNet (may require login)
- Project Euclid

- MR0325391 Pinter, Charles Terms in cylindric algebras.
*Proc. Amer. Math. Soc.***40**(1973), 568--572. (Reviewer: S. Comer)- MathSciNet (may require login)
- JSTOR (may require login)

- MR0321736 Pinter, Charles C. A simple algebra of first order logic.
*Notre Dame J. Formal Logic***14**(1973), 361--366. (Reviewer: D. Monk)- MathSciNet (may require login)
- Project Euclid

- MR0321735 Pinter, Charles A simpler set of axioms for polyadic algebras.
*Fund. Math.***79**(1973), no. 3, 223--232. (Reviewer: S. Comer)- MathSciNet (may require login)
- Fundamenta Mathematicae

- MR0317931 Pinter, Charles Cylindric algebras and algebras of substitutions.
*Trans. Amer. Math. Soc.***175**(1973), 167--179. (Reviewer: A. Preller)- MathSciNet (may require login)
- JSTOR (may require login)

- MR0317930 Pinter, Charles Sur les algèbres transformationnelles admettant une structure d'algèbre polyadique. (French)
*C. R. Acad. Sci. Paris Sér. A-B***276**(1973), A1261--A1264. (Reviewer: R. C. Lyndon)- MathSciNet (may require login)

- MR0319695 Pinter, Charles C. On simplifying truth functions: a preliminary reduction of coreless formulas.
*IEEE Trans. Computers***C-20**(1971), 938--941. (Reviewer: Arnold Oberschelp)- MathSciNet (may require login)

- MR0284349 Pinter, Charles C. Set theory.
*Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont.*1971 viii+216 pp. (Reviewer: N. C. A. da Costa)- MathSciNet (may require login)

- MR0152449 Pinter, Charles Formes minimales des fonctions booléennes. (French)
*C. R. Acad. Sci. Paris***256**1963 3407--3409. (Reviewer: A. H. Stone)